The following pages link to The book thickness of a graph (Q1136775):
Displaying 50 items.
- Outer 1-planar graphs (Q289919) (← links)
- Embedding generalized Petersen graph in books (Q295940) (← links)
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- On the page number of complete odd-partite graphs (Q383683) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- A linear-time algorithm for testing outer-1-planarity (Q494794) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- On the queue-number of graphs with bounded tree-width (Q521397) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
- Ordered sets, pagenumbers and planarity (Q913833) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Counting links in complete graphs (Q1012051) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks (Q1100131) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- A trade-off between page number and page width of book embeddings of graphs (Q1120583) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- Catalan, Motzkin, and Riordan numbers (Q1300967) (← links)
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books (Q1377659) (← links)
- The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← 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)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- Minimum projective linearizations of trees in linear time (Q2059886) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
- A \((2k + 1)\)-regular graph with page-number \(k\) (Q2092439) (← links)
- Genus and book thickness of the inclusion ideal graph of a ring (Q2097113) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- On dispersability of some products of cycles (Q2116698) (← links)
- The book thickness of nilpotent graphs (Q2136363) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
