Contact graphs of boxes with unidirectional contacts
From MaRDI portal
Publication:6599818
DOI10.46298/dmtcs.10805zbMATH Open1546.05123MaRDI QIDQ6599818
Vincent Limouzy, Pascal Ochem, Daniel Gonçalves
Publication date: 6 September 2024
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
- Independence in graphs with maximum degree four
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Fractional coloring of triangle-free planar graphs
- Cubicity, boxicity, and vertex cover
- Interval representations of planar graphs
- Unit disk graphs
- On grid intersection graphs
- Complexity of diagrams
- On the complexity of diagram testing
- Corrigendum to: `Complexity of diagrams'
- A special planar satisfiability problem and a consequence of its NP- completeness
- Density of 5/2-critical graphs
- On contact graphs of paths on a grid
- The maximum clique problem in multiple interval graphs
- Wavelength Conversion in Optical Networks
- On directed local chromatic number, shift graphs, and Borsuk-like graphs
- Coloring rectangular blocks in 3-space
- Graph Theory and Probability
- Applications of a Planar Separator Theorem
- Approximation algorithms for NP-complete problems on planar graphs
- On Triangle Contact Graphs
- Hamilton Paths in Grid Graphs
- On Representing Graphs by Touching Cuboids
- Fractional Coloring of Planar Graphs of Girth Five
- Contact representations of planar graphs with cubes
- The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
- Partially ordered sets.
This page was built for publication: Contact graphs of boxes with unidirectional contacts
