Cites work
Cited in
(only showing first 100 items - show all)- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- 1-page and 2-page drawings with bounded number of crossings per edge
- Embedding Outerplanar Graphs in Small Books
- \(k\)-spine, 1-bend planarity
- Recognizing geometric intersection graphs stabbed by a line
- scientific article; zbMATH DE number 7228873 (Why is no real title available?)
- Algorithms for the fixed linear crossing number problem
- Parameterized analysis and crossing minimization problems
- Counting links in complete graphs
- On Page Number of N-free Posets
- Ordered sets, pagenumbers and planarity
- Partitions of complete geometric graphs into plane trees
- Splitting plane graphs to outerplanarity
- Using Euler’s Formula to Find the Lower Bound of the Page Number
- Packing plane spanning trees and paths in complete geometric graphs
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Schematic representation of large biconnected graphs
- Approximation of the quadratic knapsack problem
- The matching book embeddings of pseudo-Halin graphs
- Curve-constrained drawings of planar graphs
- Book thickness of the non-zero component union graph of the finite dimensional vector space
- Approximate realizations for outerplanaric degree sequences
- Universal geometric graphs
- Deciding whether graph \(G\) has page number one is in NC
- On exteriority notions in book embeddings and treewidth
- Structural properties of subdivided-line graphs
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- Extension of a theorem of Whitney
- Packing plane spanning trees into a point set
- On the dispersability of odd toroidal grids
- Towards crossing-free Hamiltonian cycles in simple drawings of complete graphs
- On asymptotic packing of geometric graphs
- Monotone drawings of graphs with few directions
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Genus and book thickness of reduced cozero-divisor graphs of commutative rings
- On the upward book thickness problem: combinatorial and complexity results
- scientific article; zbMATH DE number 7525495 (Why is no real title available?)
- Geometric thickness in a grid
- On mixed linear layouts of series-parallel graphs
- On the queue-number of graphs with bounded tree-width
- I/O-efficient path traversal in succinct planar graphs
- Succinct Representation of Labeled Graphs
- Untangling circular drawings: algorithms and complexity
- Embedding planar 5-graphs in three pages
- Planar graphs that need four pages
- Local and union page numbers
- Colored anchored visibility representations in 2D and 3D space
- A \((2k + 1)\)-regular graph with page-number \(k\)
- Genus and book thickness of the inclusion ideal graph of a ring
- Matching book thickness of generalized Petersen graphs
- On 1-bend upward point-set embeddings of \(st\)-digraphs
- Upward planar drawings on the standing and the rolling cylinders
- Simultaneous graph embedding with bends and circular arcs
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- The pagenumber of \(k\)-trees is \(O(k)\)
- A linear-time algorithm for testing outer-1-planarity
- Geometric Thickness in a Grid of Linear Area
- On Posets of Page Number 2
- Finding geometric representations of apex graphs is NP-hard
- On dispersability of some products of cycles
- On the pagenumber of trivalent Cayley graphs
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Three edge-disjoint plane spanning paths in a point set
- Book drawings of complete bipartite graphs
- Experimental evaluation of book drawing algorithms
- Packing 1-plane Hamiltonian cycles in complete geometric graphs
- Vertex-bipartition: a unified approach for kernelization of graph linear layout problems parameterized by vertex cover
- Characterisations and examples of graph classes with bounded expansion
- On the queue number of planar graphs
- Mixed linear layouts of planar graphs
- On Mixed Linear Layouts of Series-Parallel Graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
- The dispersability of the Kronecker cover of the product of complete graphs and cycles
- Quantum graph drawing (best student paper)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Minimum projective linearizations of trees in linear time
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Book embeddings and crossing numbers
- Stack and queue number of 2-trees
- Graph classes and forbidden patterns on three vertices
- Layouts of Expander Graphs
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- A trade-off between page number and page width of book embeddings of graphs
- Outer 1-planar graphs
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Characterizations of deque and queue graphs
- Embedding generalized Petersen graph in books
- Schematic Representation of Biconnected Graphs
- Separation dimension of graphs and hypergraphs
- Two-page book embeddings of 4-planar graphs
- A survey on the Intersection graphs of ideals of rings
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- On the upward book thickness problem: combinatorial and complexity results
- On the page number of complete odd-partite graphs
- Book embeddings of regular graphs
- The book thickness of nilpotent graphs
- Catalan, Motzkin, and Riordan numbers
- 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)
