Weak Unit Disk and Interval Representation of Graphs
DOI10.1007/978-3-662-53174-7_17zbMath1417.05131arXiv1408.6928OpenAlexW2490971208MaRDI QIDQ2827814
Sergey Pupyrev, Md. Jawaherul Alam, Jackson Toeniskoetter, Stephen G. Kobourov
Publication date: 21 October 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.6928
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- A linear-time algorithm for proper interval graph recognition
- Colouring the real line
- Star coloring high girth planar graphs
- On the maximum average degree and the oriented chromatic number of a graph
- Unit disk graph recognition is NP-hard
- Coloring with no 2-colored \(P_4\)'s
- Threshold graphs and related topics
- Decomposing a planar graph into degenerate graphs
- Integer realizations of disk and segment graphs
- Topology of series-parallel networks
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs
- Unit Contact Representations of Grid Subgraphs with Regular Polytopes in 2D and 3D
- Approximate Proximity Drawings
- Star coloring of sparse graphs
- Distance Graphs on the Integers
- Graph Sandwich Problems
- On Representing Graphs by Touching Cuboids
- Difference graphs
- Representing graphs by disks and balls (a survey of recognition-complexity results)
This page was built for publication: Weak Unit Disk and Interval Representation of Graphs
