Pages that link to "Item:Q2369933"
From MaRDI portal
The following pages link to Graph treewidth and geometric thickness parameters (Q2369933):
Displayed 36 items.
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Thickness and colorability of geometric graphs (Q679741) (← links)
- Three ways to cover a graph (Q898135) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition (Q992509) (← links)
- Induced and weak induced arboricities (Q1625812) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Coloring drawings of graphs (Q2073312) (← links)
- Geodesic obstacle representation of graphs (Q2096390) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Planar graphs that need four pages (Q2200923) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Local and union page numbers (Q2206876) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Drawing Cubic Graphs with the Four Basic Slopes (Q3223959) (← links)
- PROXIMITY DRAWINGS OF HIGH-DEGREE TREES (Q3459369) (← links)
- Layouts of Expander Graphs (Q3466402) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- (Q5002693) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- Book Embedding of Graphs on the Projective Plane (Q5237910) (← links)
- On dispersable book embeddings (Q5915585) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Graphs of linear growth have bounded treewidth (Q6115513) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)