Decidability of string graphs
type: Item
instance of: scholarly article
title: Decidability of string graphs
zbMATH Open document ID: 1073.68065
author: Marcus Schaefer
author: D. Štefankovič
published in: Journal of Computer and System Sciences
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2117376
MaRDI profile type: Publication
full work available at URL: j.jcss.2003.07.002
OpenAlex ID: W3030259189
cites work: Maintaining knowledge about temporal intervals
cites work: Q4542571
cites work: How to draw a planar graph on a grid
cites work: Intersection graphs of curves in the plane
cites work: Q4737278
cites work: Crossing Number is NP-Complete
cites work: Computing crossing numbers in quadratic time
cites work: Q4003410
cites work: String graphs. I: The number of critical nonstring graphs is infinite
cites work: String graphs. II: Recognizing string graphs is NP-hard
cites work: String graphs requiring exponential representations
cites work: Q3745859
cites work: Q3821580
cites work: Graphs on surfaces
cites work: Classical recursion theory. Vol. II
cites work: Which crossing number is it anyway?
cites work: Q3043722
cites work: Topological queries in spatial databases
cites work: Q3138887
cites work: Topology of Thin Film RC Circuits
DOI: 10.1016/J.JCSS.2003.07.002
Recommended article: Decidability of string graphs
Recommended article: Q3043722
Recommended article: Recognizing string graphs is decidable
Recommended article: String decompositions of graphs
Recommended article: Recognizing string graphs in NP
Recommended article: String graphs and incomparability graphs
Recommended article: Constructing decidable graphs from decidable structures
Recommended article: Q3826516
Recommended article: Q4288808
description: scientific article; zbMATH DE number 2117376