The book thickness of a graph
From MaRDI portal
Publication:1136775
Cites work
Cited in
(only showing first 100 items - show all)- Packing plane spanning trees and paths in complete geometric graphs
- Catalan, Motzkin, and Riordan numbers
- A simulated annealing algorithm for determining the thickness of a graph
- Data Structures and their Planar Graph Layouts
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- Characterizations of deque and queue graphs
- Structural properties of subdivided-line graphs
- Simultaneous graph embedding with bends and circular arcs
- Succinct representation of labeled graphs
- Geometric biplane graphs. II: Graph augmentation
- An improved upper bound on the queue number of planar graphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Optimum embedding of complete graphs in books
- The pagenumber of toroidal graphs is at most seven
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Geometric thickness in a grid
- Partitions of complete geometric graphs into plane trees
- Algorithms for the fixed linear crossing number problem
- Partitions of complete bipartite geometric graphs into plane perfect matchings
- On graph thickness, geometric thickness, and separator theorems
- On the pagenumber of complete bipartite graphs
- Ordered sets, pagenumbers and planarity
- Deciding whether graph \(G\) has page number one is in NC
- Improved book-embeddings of incomplete hypercubes
- Mixed linear layouts of planar graphs
- Extension of a theorem of Whitney
- Embedding Outerplanar Graphs in Small Books
- Approximation of the quadratic knapsack problem
- On dispersability of some products of cycles
- Curve-constrained drawings of planar graphs
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- The pagenumber of \(k\)-trees is \(O(k)\)
- scientific article; zbMATH DE number 7525495 (Why is no real title available?)
- On the page number of complete odd-partite graphs
- A trade-off between page number and page width of book embeddings of graphs
- On simultaneous planar graph embeddings
- On the pagenumber of trivalent Cayley graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding planar graphs in four pages
- The pagenumber of the class of bandwidth-k graphs is \(k-1\)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Minimum projective linearizations of trees in linear time
- On the queue-number of graphs with bounded tree-width
- Drawing graphs on few circles and few spheres
- I/O-efficient path traversal in succinct planar graphs
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Optimal one-page tree embeddings in linear time
- The Rique-number of graphs
- Characterisations and examples of graph classes with bounded expansion
- Monotone drawings of graphs with few directions
- Upward planar drawings on the standing and the rolling cylinders
- Layouts of Expander Graphs
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
- Counting links in complete graphs
- Embedding generalized Petersen graph in books
- A linear-time algorithm for testing outer-1-planarity
- Outer 1-planar graphs
- Succinct Representation of Labeled Graphs
- Separation dimension of graphs and hypergraphs
- Two-page book embeddings of 4-planar graphs
- Graph classes and forbidden patterns on three vertices
- On the upward book thickness problem: combinatorial and complexity results
- Genus and book thickness of the inclusion ideal graph of a ring
- Packing 1-plane Hamiltonian cycles in complete geometric graphs
- Mixed linear layouts: complexity, heuristics, and experiments
- A survey on book-embedding of planar graphs
- Embedding planar 5-graphs in three pages
- The pagewidth of trivalent planar graphs
- Book embedding of complex network with community structure
- Finding geometric representations of apex graphs is NP-hard
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
- Geometric planar networks on bichromatic collinear points
- Planar graphs that need four pages
- On mixed linear layouts of series-parallel graphs
- Local and union page numbers
- The Local Queue Number of Graphs with Bounded Treewidth
- On Mixed Linear Layouts of Series-Parallel Graphs
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Colored anchored visibility representations in 2D and 3D space
- On asymptotic packing of geometric graphs
- The book thickness of nilpotent graphs
- Linear layouts of complete graphs
- Stack-number is not bounded by queue-number
- Two-page book embedding of trees under vertex-neighborhood constraints
- Computing upward topological book embeddings of upward planar digraphs
- The matching book embeddings of pseudo-Halin graphs
- On exteriority notions in book embeddings and treewidth
- On Page Number of N-free Posets
- Upward book embeddings of st-graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- An analysis of some linear graph layout heuristics
- Parameterized analysis and crossing minimization problems
- Arc diagrams, flip distances, and Hamiltonian triangulations
- 1-page and 2-page drawings with bounded number of crossings per edge
- Approximating the fixed linear crossing number
- Subhamiltonian toroidal graphs
- Experimental evaluation of book drawing algorithms
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)