scientific article; zbMATH DE number 2159644

Publication date: 20 April 2005

Full work available at URL: https://eudml.org/doc/124357

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

book embedding graph drawing graph layout queue layout page-number queue-number stack-number stack layout arch layout book-thickness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (51)

Improved bounds for colouring circle graphs ⋮ Parameterized Algorithms for Queue Layouts ⋮ Two-page book embeddings of 4-planar graphs ⋮ Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number ⋮ Stack-number is not bounded by queue-number ⋮ Graph drawings with few slopes ⋮ On the queue-number of partial orders ⋮ The 2-page crossing number of \(K_{n}\) ⋮ The mixed page number of graphs ⋮ Layered separators in minor-closed graph classes with applications ⋮ Queue layouts of iterated line directed graphs ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ An improved upper bound on the queue number of planar graphs ⋮ Stack and Queue Layouts via Layered Separators ⋮ Parameterized algorithms for book embedding problems ⋮ Local and union page numbers ⋮ Mixed linear layouts: complexity, heuristics, and experiments ⋮ Lazy queue layouts of posets ⋮ Book drawings of complete bipartite graphs ⋮ Outerplanar graph drawings with few slopes ⋮ Mixed Linear Layouts of Planar Graphs ⋮ Upward Partitioned Book Embeddings ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ Planar projections of graphs ⋮ Data Structures and their Planar Graph Layouts ⋮ Extension of a theorem of Whitney ⋮ On the queue-number of graphs with bounded tree-width ⋮ A new upper bound on the queuenumber of hypercubes ⋮ Partitions of complete geometric graphs into plane trees ⋮ Unnamed Item ⋮ On dispersable book embeddings ⋮ Layouts of Expander Graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering ⋮ On fixed-order book thickness parameterized by the pathwidth of the vertex ordering ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Defective and clustered choosability of sparse graphs ⋮ On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page ⋮ Upward Book Embeddings of st-Graphs ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ Characterizations of Deque and Queue Graphs ⋮ On mixed linear layouts of series-parallel graphs ⋮ On off-diagonal ordered Ramsey numbers of nested matchings ⋮ Parameterized Algorithms for Queue Layouts ⋮ Lazy Queue Layouts of Posets ⋮ On Mixed Linear Layouts of Series-Parallel Graphs ⋮ Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis ⋮ On the complexity of recognizing Wheeler graphs

This page was built for publication: