The following pages link to The book thickness of a graph (Q1136775):
Displayed 40 items.
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← 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)
- 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)
- The pagewidth of trivalent planar graphs (Q2276971) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Extension of a theorem of Whitney (Q2470340) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- On the pagenumber of trivalent Cayley graphs (Q2495909) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- On Posets of Page Number 2 (Q3439398) (← links)
- On Page Number of N-free Posets (Q3439444) (← links)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES (Q3442763) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- Succinct Representation of Labeled Graphs (Q5387767) (← links)
- The pagenumber of \(k\)-trees is \(O(k)\) (Q5931789) (← links)