The book thickness of a graph

DOI10.1016/0095-8956(79)90021-2zbMATH Open0427.05028DBLPjournals/jct/BernhartK79OpenAlexW1998294201WikidataQ55882094 ScholiaQ55882094MaRDI QIDQ1136775FDOQ1136775

Cites Work

Every planar map is four colorable. II: Reducibility
Title not available (Why is that?)
Title not available (Why is that?)
An inequality for the chromatic number of a graph

Cited In (only showing first 100 items - show all)

Finding geometric representations of apex graphs is NP-hard
Fan-crossing free graphs and their relationship to other beyond-planar graphs
Experimental evaluation of book drawing algorithms
Book drawings of complete bipartite graphs
Packing 1-plane Hamiltonian cycles in complete geometric graphs
On Mixed Linear Layouts of Series-Parallel Graphs
On the queue number of planar graphs
Mixed linear layouts: complexity, heuristics, and experiments
Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
Stack and queue number of 2-trees
Simpler algorithms for testing two-page book embedding of partitioned graphs
Book embeddings of regular graphs
The book thickness of nilpotent graphs
Subhamiltonian toroidal graphs
Parameterized algorithms for book embedding problems
A survey on book-embedding of planar graphs
Computing upward topological book embeddings of upward planar digraphs
Approximating the fixed linear crossing number
Book thickness of toroidal zero-divisor graphs
Two-page book embedding of trees under vertex-neighborhood constraints
Upward book embeddings of st-graphs
The Local Queue Number of Graphs with Bounded Treewidth
Book embedding of graphs on the projective plane
Linear layouts of complete graphs
Stack-number is not bounded by queue-number
An analysis of some linear graph layout heuristics
Parameterized algorithms for book embedding problems
Book embedding of locally planar graphs on orientable surfaces
Geometric planar networks on bichromatic collinear points
An improved fixed-parameter algorithm for one-page crossing minimization
The mixed page number of graphs
The pagewidth of trivalent planar graphs
Book embedding of complex network with community structure
On dispersable book embeddings
1-page and 2-page drawings with bounded number of crossings per edge
\(k\)-spine, 1-bend planarity
On Page Number of N-free Posets
Parameterized analysis and crossing minimization problems
Partitions of complete geometric graphs into plane trees
Packing plane spanning trees and paths in complete geometric graphs
Finding geometric representations of apex graphs is \textsf{NP}-hard
On exteriority notions in book embeddings and treewidth
Packing plane spanning trees into a point set
On asymptotic packing of geometric graphs
Arc diagrams, flip distances, and Hamiltonian triangulations
On mixed linear layouts of series-parallel graphs
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
Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
Simultaneous graph embedding with bends and circular arcs
A linear-time algorithm for testing outer-1-planarity
On dispersability of some products of cycles
On the pagenumber of trivalent Cayley graphs
SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
Mixed linear layouts of planar graphs
Visibility representations of boxes in 2.5 dimensions
Characterisations and examples of graph classes with bounded expansion
Minimum projective linearizations of trees in linear time
Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
Graph classes and forbidden patterns on three vertices
Layouts of Expander Graphs
A trade-off between page number and page width of book embeddings of graphs
Outer 1-planar graphs
Characterizations of deque and queue graphs
Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
Optimal book embeddings of the FFT, Benes, and barrel shifter networks
Embedding generalized Petersen graph in books
Separation dimension of graphs and hypergraphs
Two-page book embeddings of 4-planar graphs
On the page number of complete odd-partite graphs
Drawing graphs on few circles and few spheres
Catalan, Motzkin, and Riordan numbers
A simulated annealing algorithm for determining the thickness of a graph
Geometric biplane graphs. II: Graph augmentation
The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
The pagenumber of the class of bandwidth-k graphs is \(k-1\)
Succinct representation of labeled graphs
Partitions of complete bipartite geometric graphs into plane perfect matchings
The book thickness of 1-planar graphs is constant
Optimal one-page tree embeddings in linear time
An improved upper bound on the queue number of planar graphs
On simultaneous planar graph embeddings
Embedding planar graphs in four pages
RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
Data Structures and their Planar Graph Layouts
The Rique-number of graphs
Optimum embedding of complete graphs in books
The pagenumber of toroidal graphs is at most seven
On graph thickness, geometric thickness, and separator theorems
On the pagenumber of complete bipartite graphs
Improved book-embeddings of incomplete hypercubes
Embedding Outerplanar Graphs in Small Books
Embedding de Bruijn, Kautz and shuffle-exchange networks in books
Algorithms for the fixed linear crossing number problem
Counting links in complete graphs

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)