Pages that link to "Item:Q4304061"
From MaRDI portal
The following pages link to Graphs with E Edges Have Pagenumber O(√E) (Q4304061):
Displaying 34 items.
- Crossings in grid drawings (Q405129) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
- A trade-off between page number and page width of book embeddings of graphs (Q1120583) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
- On the pagenumber of complete bipartite graphs (Q1386481) (← links)
- Geometric thickness in a grid (Q1417581) (← links)
- Algorithms for the fixed linear crossing number problem (Q1613416) (← links)
- A \((2k + 1)\)-regular graph with page-number \(k\) (Q2092439) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- The mixed page number of graphs (Q2167907) (← links)
- Local and union page numbers (Q2206876) (← links)
- Graph drawings with few slopes (Q2385698) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Stack and Queue Layouts via Layered Separators (Q2961542) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389) (← links)
- Genus g Graphs Have Pagenumber O(√g) (Q4304062) (← links)
- On the book size of graphs with large minimum degree (Q4878285) (← links)
- On Crossing Sets, Disjoint Sets, and Pagenumber (Q4943069) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Book Embedding of Graphs on the Projective Plane (Q5237910) (← links)
- Book Embeddings of Regular Graphs (Q5254031) (← links)
- On dispersable book embeddings (Q5915585) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs (Q6080147) (← links)
- Stack and queue number of 2-trees (Q6085708) (← links)
