Threshold-coloring and unit-cube contact representation of planar graphs
From MaRDI portal
Publication:344821
DOI10.1016/j.dam.2015.09.003zbMath1350.05027OpenAlexW1845540793MaRDI QIDQ344821
Md. Jawaherul Alam, Gašper Fijavž, Stephen G. Kobourov, Steven Chaplick, Michael Kaufmann, Sergey Pupyrev, Jackson Toeniskoetter
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.003
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- A linear-time algorithm for proper interval graph recognition
- Simple linear time recognition of unit interval graphs
- Colouring the real line
- Interval representations of planar graphs
- On the complexity of DNA physical mapping
- Systems of distant representatives
- Threshold graphs and related topics
- Fun with algorithms. 7th international conference, FUN 2014, Lipari Island, Sicily, Italy, July 1--3, 2014. Proceedings
- An unexpected result in coding the vertices of a graph
- Weak Unit Disk and Interval Representation of Graphs
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs
- Integral Mixed Unit Interval Graphs
- Labelling Graphs with a Condition at Distance 2
- Graph Classes: A Survey
- Distance Graphs on the Integers
- Graph Sandwich Problems
- On Representing Graphs by Touching Cuboids
- Contact representations of planar graphs with cubes
- Difference graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
This page was built for publication: Threshold-coloring and unit-cube contact representation of planar graphs
