Cites work
Cited in
(only showing first 100 items - show all)- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Counting links in complete graphs
- Optimal one-page tree embeddings in linear time
- Improved book-embeddings of incomplete hypercubes
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Embedding planar graphs in four pages
- A trade-off between page number and page width of book embeddings of graphs
- Deciding whether graph \(G\) has page number one is in NC
- Catalan, Motzkin, and Riordan numbers
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- The pagenumber of toroidal graphs is at most seven
- Optimum embedding of complete graphs in books
- On the pagenumber of complete bipartite graphs
- Geometric thickness in a grid
- Algorithms for the fixed linear crossing number problem
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
- 1-page and 2-page drawings with bounded number of crossings per edge
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Structural properties of subdivided-line graphs
- Minimum projective linearizations of trees in linear time
- On asymptotic packing of geometric graphs
- On mixed linear layouts of series-parallel graphs
- A (2k + 1)-regular graph with page-number k
- Genus and book thickness of the inclusion ideal graph of a ring
- Augmenting a tree to a k-arbor-connected graph with pagenumber k
- On dispersability of some products of cycles
- The book thickness of nilpotent graphs
- A survey on book-embedding of planar graphs
- Subhamiltonian toroidal graphs
- Stack-number is not bounded by queue-number
- Linear layouts of complete graphs
- On the queue number of planar graphs
- Finding geometric representations of apex graphs is NP-hard
- The mixed page number of graphs
- Parameterized analysis and crossing minimization problems
- Embedding planar 5-graphs in three pages
- Planar graphs that need four pages
- Colored anchored visibility representations in 2D and 3D space
- Packing plane spanning trees into a point set
- Parameterized algorithms for book embedding problems
- Local and union page numbers
- Mixed linear layouts: complexity, heuristics, and experiments
- Computing upward topological book embeddings of upward planar digraphs
- The pagewidth of trivalent planar graphs
- Book embedding of complex network with community structure
- On exteriority notions in book embeddings and treewidth
- Geometric biplane graphs. II: Graph augmentation
- Two-page book embedding of trees under vertex-neighborhood constraints
- Book thickness of toroidal zero-divisor graphs
- Succinct representation of labeled graphs
- Book drawings of complete bipartite graphs
- Approximating the fixed linear crossing number
- Extension of a theorem of Whitney
- Partitions of complete geometric graphs into plane trees
- An analysis of some linear graph layout heuristics
- On the pagenumber of trivalent Cayley graphs
- \(k\)-spine, 1-bend planarity
- A simulated annealing algorithm for determining the thickness of a graph
- Packing plane spanning trees and paths in complete geometric graphs
- Book embedding of locally planar graphs on orientable surfaces
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Geometric planar networks on bichromatic collinear points
- An improved upper bound on the queue number of planar graphs
- Outer 1-planar graphs
- Embedding generalized Petersen graph in books
- Two-page book embeddings of 4-planar graphs
- Separation dimension of graphs and hypergraphs
- Characterizations of deque and queue graphs
- Approximation of the quadratic knapsack problem
- scientific article; zbMATH DE number 7228873 (Why is no real title available?)
- Geometric Thickness in a Grid of Linear Area
- On Posets of Page Number 2
- On Page Number of N-free Posets
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Layouts of Expander Graphs
- Embedding Outerplanar Graphs in Small Books
- On the page number of complete odd-partite graphs
- Upward planar drawings on the standing and the rolling cylinders
- Classification of book representations of K₆
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Mixed linear layouts of planar graphs
- Experimental evaluation of book drawing algorithms
- Data Structures and their Planar Graph Layouts
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs on few circles and few spheres
- Schematic representation of large biconnected graphs
- The Local Queue Number of Graphs with Bounded Treewidth
- On Mixed Linear Layouts of Series-Parallel Graphs
- Schematic Representation of Biconnected Graphs
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
- Monotone drawings of graphs with few directions
- Triconnected planar graphs of maximum degree five are subhamiltonian
- Packing 1-plane Hamiltonian cycles in complete geometric graphs
- Matching book thickness of generalized Petersen graphs
- Upward book embeddings of st-graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- Edge crossings in random linear arrangements
This page was built for publication: The book thickness of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1136775)
