Integer realizations of disk and segment graphs
From MaRDI portal
Publication:1932476
DOI10.1016/j.jctb.2012.09.004zbMath1257.05108arXiv1111.2931MaRDI QIDQ1932476
Tobias Müller, Colin J. H. McDiarmid
Publication date: 18 January 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.2931
Related Items
On Embeddability of Unit Disk Graphs onto Straight Lines, The Complexity of Drawing a Graph in a Polygonal Region, Smoothing the Gap Between NP and ER, Refining the hierarchies of classes of geometric intersection graphs, Optimality program in segment and string graphs, Unnamed Item, On embeddability of unit disk graphs onto straight lines, The complexity of the Hausdorff distance, Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality, Logical labeling schemes, Topological art in simple galleries, Sphere and dot product representations of graphs, On the recognition of unit disk graphs and the distance geometry problem with ranges, Recognition and complexity of point visibility graphs, On forbidden induced subgraphs for unit disk graphs, Arrangements of pseudocircles and circles, Co-bipartite neighborhood edge elimination orderings, The complexity of drawing a graph in a polygonal region, Implicit representation conjecture for semi-algebraic graphs, Embedding ray intersection graphs and global curve simplification, On the speed of algebraically defined graph classes, Subexponential algorithms for variants of the homomorphism problem in string graphs, Efficient sub-5 approximations for minimum dominating sets in unit disk graphs, Weak Unit Disk and Interval Representation of Graphs
