Simple realizability of complete abstract topological graphs in P
type: Item
instance of: scholarly article
title: Simple realizability of complete abstract topological graphs in P
zbMATH Open document ID: 1214.05013
author: Jan Kynčl
published in: Discrete \& Computational Geometry
publication date: 2011-03-31T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5872629
zbMATH Keywords: abstract topological graph
zbMATH Keywords: simple complete topological graph
zbMATH Keywords: simple realizability
MaRDI profile type: Publication
full work available at URL: s00454-010-9320-x
OpenAlex ID: W2061296093
cites work: On the crossing number of complete graphs
cites work: Q3025877
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Simultaneous Graph Embeddings with Fixed Edges
cites work: Proof of a conjecture of Burr, Grünbaum, and Sloane
cites work: On complexity of the word problem in braid groups and mapping class groups
cites work: Q3139539
cites work: Intersections of curves on surfaces
cites work: String graphs. II: Recognizing string graphs is NP-hard
cites work: A special planar satisfiability problem and a consequence of its NP- completeness
cites work: Noncrossing Subgraphs in Topological Layouts
cites work: Q3474685
cites work: String graphs requiring exponential representations
cites work: Intersection graphs of segments
cites work: The Complexity of Several Realizability Problems for Abstract Topological Graphs
cites work: Enumeration of simple complete topological graphs
cites work: On edges crossing few other edges in simple topological complete graphs
cites work: Q3811367
cites work: Q3819622
cites work: Unavoidable configurations in complete topological graphs
cites work: Recognizing string graphs is decidable
cites work: How many ways can one draw a graph?
cites work: Algorithms for Jordan curves on compact surfaces
cites work: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
cites work: Complexity of Some Geometric and Topological Problems
cites work: Recognizing string graphs in NP
cites work: Decidability of string graphs
cites work: Q3974991
cites work: Q4471347
DOI: 10.1007/S00454-010-9320-X
description: scientific article; zbMATH DE number 5872629