Threshold-Coloring and Unit-Cube Contact Representation of Graphs
From MaRDI portal
Publication:2864287
DOI10.1007/978-3-642-45043-3_4zbMath1417.05056arXiv1302.6183OpenAlexW1751139264MaRDI QIDQ2864287
Stephen G. Kobourov, Gašper Fijavž, Steven Chaplick, Md. Jawaherul Alam, Michael Kaufmann, Sergey Pupyrev
Publication date: 6 December 2013
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.6183
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Threshold-coloring and unit-cube contact representation of planar graphs ⋮ Weak Unit Disk and Interval Representation of Graphs
