Pages that link to "Item:Q5120157"
From MaRDI portal
The following pages link to Four pages are indeed necessary for planar graphs (Q5120157):
Displaying 26 items.
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Recognizing DAGs with page-number 2 is NP-complete (Q2682927) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Lazy queue layouts of posets (Q2701382) (← links)
- Two-Page Book Embeddings of 4-Planar Graphs (Q2965479) (← links)
- Lazy Queue Layouts of Posets (Q5014104) (← links)
- On Mixed Linear Layouts of Series-Parallel Graphs (Q5014112) (← links)
- Book Embedding of Graphs on the Projective Plane (Q5237910) (← 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)
- Straight-line drawings of 1-planar graphs (Q6049552) (← links)
- A Sublinear Bound on the Page Number of Upward Planar Graphs (Q6057803) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← 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)
- On families of planar DAGs with constant stack number (Q6560144) (← links)
- On 3-coloring circle graphs (Q6560146) (← links)
- On 3-coloring circle graphs (Q6636987) (← links)
