Pages that link to "Item:Q1077425"
From MaRDI portal
The following pages link to Interval representations of planar graphs (Q1077425):
Displaying 50 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Boxicity of line graphs (Q409342) (← links)
- Boxicity and topological invariants (Q499501) (← links)
- Box representations of embedded graphs (Q527439) (← links)
- Boxicity of leaf powers (Q659669) (← links)
- Chordal bipartite graphs with high boxicity (Q659714) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Boxicity, poset dimension, and excluded minors (Q668021) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters (Q901030) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Intersection dimensions of graph classes (Q1334942) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- Local and union boxicity (Q1709530) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Local boxicity (Q2122684) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Representing graphs and hypergraphs by touching polygons in 3D (Q2206825) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- The interval number of a planar graph is at most three (Q2221918) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- The dimension of posets with planar cover graphs. (Q2354607) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- Boxicity and maximum degree (Q2477634) (← links)
- Boxicity of series-parallel graphs (Q2509298) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Cubicity of Interval Graphs and the Claw Number (Q2851505) (← links)
- Cubicity of interval graphs and the claw number (Q3061191) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Contact Representations of Graphs in 3D (Q3449802) (← links)
- On the Cubicity of Interval Graphs (Q3503487) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
