Interval representations of planar graphs
From MaRDI portal
Publication:1077425
DOI10.1016/0095-8956(86)90061-4zbMath0595.05027OpenAlexW1971244706MaRDI QIDQ1077425
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90061-4
intersection graphplanar graphinterval representationd-dimensional closed intervalstrict 3-box graph
Related Items
Local boxicity ⋮ Intersection dimensions of graph classes ⋮ Structural parameterizations for boxicity ⋮ Contact Representations of Graphs in 3D ⋮ Separation dimension of graphs and hypergraphs ⋮ Boxicity of graphs on surfaces ⋮ Geometric representation of graphs in low dimension using axis parallel boxes ⋮ Boxicity and treewidth ⋮ Finding geometric representations of apex graphs is NP-hard ⋮ Threshold-coloring and unit-cube contact representation of planar graphs ⋮ On intersection representations of co-planar graphs ⋮ Chronological rectangle digraphs which are two-terminal series-parallel ⋮ Morphing triangle contact representations of triangulations ⋮ Algorithms and complexity for geodetic sets on partial grids ⋮ Matchings, coverings, and Castelnuovo-Mumford regularity ⋮ On the Cubicity of Interval Graphs ⋮ Boxicity of line graphs ⋮ Sublinear approximation algorithms for boxicity and related problems ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Optimal polygonal representation of planar graphs ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Local and union boxicity ⋮ Unnamed Item ⋮ Intersection dimension and graph invariants ⋮ The interval number of a planar graph is at most three ⋮ On grid intersection graphs ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Boxicity of leaf powers ⋮ Chordal bipartite graphs with high boxicity ⋮ Boxicity of circular arc graphs ⋮ Orthogonal Tree Decompositions of Graphs ⋮ Boxicity, poset dimension, and excluded minors ⋮ Boxicity and topological invariants ⋮ Boxicity and maximum degree ⋮ Box representations of embedded graphs ⋮ Boxicity and cubicity of asteroidal triple free graphs ⋮ Cubicity of interval graphs and the claw number ⋮ Boxicity of series-parallel graphs ⋮ Cubicity, degeneracy, and crossing number ⋮ The cubicity of hypercube graphs ⋮ Representing graphs as the intersection of cographs and threshold graphs ⋮ A constant factor approximation algorithm for boxicity of circular arc graphs ⋮ Better bounds for poset dimension and boxicity ⋮ Morphing Contact Representations of Graphs ⋮ Boxicity of graphs with bounded degree ⋮ Cubicity, boxicity, and vertex cover ⋮ An upper bound for cubicity in terms of boxicity ⋮ Localized and compact data-structure for comparability graphs ⋮ Boxicity of Halin graphs ⋮ Bounds for the boxicity of Mycielski graphs ⋮ On the cubicity of certain graphs ⋮ On the cubicity of interval graphs ⋮ Shorter Labeling Schemes for Planar Graphs ⋮ Cubicity of Interval Graphs and the Claw Number ⋮ Lower bounds for boxicity ⋮ Distance Labeling for Permutation Graphs ⋮ The dimension of posets with planar cover graphs.
Cites Work
