Cites work
Cited in
(only showing first 100 items - show all)- 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
- A simulated annealing algorithm for determining the thickness of a graph
- Geometric biplane graphs. II: Graph augmentation
- Drawing graphs on few circles and few spheres
- Subhamiltonian toroidal graphs
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
- Parameterized algorithms for book embedding problems
- A survey on book-embedding of planar graphs
- The pagenumber of the class of bandwidth-k graphs is k-1
- Computing upward topological book embeddings of upward planar digraphs
- Approximating the fixed linear crossing number
- Book thickness of toroidal zero-divisor graphs
- Succinct representation of labeled graphs
- Linear layouts of bipartite planar graphs
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- 2-colored point-set embeddings of partial 2-trees
- Two-page book embedding of trees under vertex-neighborhood constraints
- Optimal one-page tree embeddings in linear time
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
- Partitions of complete bipartite geometric graphs into plane perfect matchings
- Upward book embeddings of st-graphs
- Classification of book representations of \(K_6\)
- An improved upper bound on the queue number of planar graphs
- On dispersability of some circulant graphs
- The Local Queue Number of Graphs with Bounded Treewidth
- Efficient deterministic algorithms for embedding graphs on books
- On asymptotic packing of convex geometric and ordered graphs
- A positive fraction Erdős-Szekeres theorem and its applications
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- On simultaneous planar graph embeddings
- Book embedding of graphs on the projective plane
- Embedding planar graphs in four pages
- Linear layouts of complete graphs
- Stack-number is not bounded by queue-number
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- An analysis of some linear graph layout heuristics
- Book embedding of locally planar graphs on orientable surfaces
- Parameterized algorithms for book embedding problems
- Data Structures and their Planar Graph Layouts
- The maximum linear arrangement problem for trees under projectivity and planarity
- On graph thickness, geometric thickness, and separator theorems
- Optimum embedding of complete graphs in books
- The pagenumber of toroidal graphs is at most seven
- Improved book-embeddings of incomplete hypercubes
- On the pagenumber of complete bipartite graphs
- Geometric planar networks on bichromatic collinear points
- The Rique-number of graphs
- Splitting plane graphs to outerplanarity
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- The mixed page number of graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- The pagewidth of trivalent planar graphs
- Book embedding of complex network with community structure
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)
