The following pages link to The book thickness of a graph (Q1136775):
Displaying 50 items.
- Subhamiltonian toroidal graphs (Q2150522) (← links)
- Stack-number is not bounded by queue-number (Q2151179) (← links)
- Linear layouts of complete graphs (Q2151449) (← links)
- On the queue number of planar graphs (Q2151450) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- The mixed page number of graphs (Q2167907) (← 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)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- Packing plane spanning trees into a point set (Q2206739) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Local and union page numbers (Q2206876) (← links)
- Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- The pagewidth of trivalent planar graphs (Q2276971) (← links)
- Book embedding of complex network with community structure (Q2279645) (← links)
- On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
- Geometric biplane graphs. II: Graph augmentation (Q2345512) (← links)
- Two-page book embedding of trees under vertex-neighborhood constraints (Q2367407) (← links)
- Book thickness of toroidal zero-divisor graphs (Q2404145) (← links)
- The book thickness of 1-planar graphs is constant (Q2408921) (← links)
- Succinct representation of labeled graphs (Q2428673) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← 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)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)
- Fan-crossing free graphs and their relationship to other beyond-planar graphs (Q2663047) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- An improved upper bound on the queue number of planar graphs (Q2684487) (← links)
- Characterizations of Deque and Queue Graphs (Q3104763) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- (Q3305178) (← 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)
- Layouts of Expander Graphs (Q3466402) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Classification of book representations of K6 (Q4596289) (← links)
- Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth (Q4611385) (← links)
- Mixed Linear Layouts of Planar Graphs (Q4625112) (← links)
- Experimental Evaluation of Book Drawing Algorithms (Q4625114) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
