Embedding planar graphs in four pages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4128415 (Why is no real title available?)
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- Efficient Planarity Testing
- Sorting Using Networks of Queues and Stacks
- The Complexity of Coloring Circular Arcs and Chords
- The book thickness of a graph
Cited in
(only showing first 100 items - show all)- scientific article; zbMATH DE number 4128415 (Why is no real title available?)
- Planar and grid graph reachability problems
- Embedding the incomplete hypercube in books
- 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
- Mixed linear layouts: complexity, heuristics, and experiments
- Characterizations of deque and queue graphs
- Structural properties of subdivided-line graphs
- On certain Hamiltonian inner triangulations
- Succinct representation of labeled graphs
- Embedding planar 5-graphs in three pages
- Four pages are indeed necessary for planar graphs
- Book embedding of toroidal bipartite graphs
- An improved upper bound on the queue number of planar graphs
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- The pagenumber of toroidal graphs is at most seven
- Planar graphs that need four pages
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- On mixed linear layouts of series-parallel graphs
- Queue layouts of planar 3-trees
- Queue layouts of planar 3-trees
- Beyond outerplanarity
- Local and union page numbers
- Deciding whether graph \(G\) has page number one is in NC
- A genetic algorithm for finding the pagenumber of interconnection networks
- Embedding de Bruijn and Shuffle-Exchange Graphs in Five Pages
- Improved book-embeddings of incomplete hypercubes
- Planar graphs, via well-orderly maps and trees
- Mixed linear layouts of planar graphs
- Small point sets for simply-nested planar graphs
- On the pagenumber of \(k\)-trees
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Equipartitions of graphs
- Approximation of the quadratic knapsack problem
- Curve-constrained drawings of planar graphs
- Book embeddings of nonplanar graphs with small faces in few pages
- The pagenumber of \(k\)-trees is \(O(k)\)
- scientific article; zbMATH DE number 7525495 (Why is no real title available?)
- A trade-off between page number and page width of book embeddings of graphs
- On simultaneous planar graph embeddings
- Layered separators in minor-closed graph classes with applications
- The pagenumber of the class of bandwidth-k graphs is \(k-1\)
- The longest common subsequence problem for sequences with nested arc annotations.
- 1-page and 2-page drawings with bounded number of crossings per edge
- An annotated bibliography on 1-planarity
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- Embedding quadrangulations on a 2-book
- Orthogonal drawings of graphs for the automation of VLSI circuit design
- Experimental evaluation of book drawing algorithms
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- On the queue number of planar graphs
- Parameterized algorithms for book embedding problems
- Bijections for Baxter families and related objects
- On the page number of upward planar directed acyclic graphs
- On the queue-number of graphs with bounded tree-width
- Finding Hamiltonian cycles in certain planar graphs
- Parameterized algorithms for queue layouts
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Two-page book embeddings of 4-planar graphs
- Implementing a partitioned 2-page book embedding testing algorithm
- Parameterized Algorithms for Queue Layouts
- The Rique-number of graphs
- Characterisations and examples of graph classes with bounded expansion
- Small universal point sets for \(k\)-outerplanar graphs
- Embedding generalized Petersen graph in books
- Graph layouts via layered separators
- Two-page book embeddings of 4-planar graphs
- Parameterized algorithms for book embedding problems
- Sequentially embeddable graphs
- On the upward book thickness problem: combinatorial and complexity results
- On 3-coloring circle graphs
- A survey on book-embedding of planar graphs
- Book embedding of complex network with community structure
- Efficient deterministic algorithms for embedding graphs on books
- A survey on book-embedding of planar graphs
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
- The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
- Graphs of linear growth have bounded treewidth
- Planar graphs of bounded degree have bounded queue number
- Upward partitioned book embeddings
- On Mixed Linear Layouts of Series-Parallel Graphs
- Using Euler’s Formula to Find the Lower Bound of the Page Number
- Stack-number is not bounded by queue-number
- scientific article; zbMATH DE number 2188384 (Why is no real title available?)
- Computing upward topological book embeddings of upward planar digraphs
- Recognizing DAGs with page-number 2 is NP-complete
- On exteriority notions in book embeddings and treewidth
- Linear layouts of bipartite planar graphs
- Quantum graph drawing (best student paper)
- On Page Number of N-free Posets
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Upward book embeddings of st-graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings
- Treewidth, Circle Graphs, and Circular Drawings
- Recognizing DAGs with page-number 2 is NP-complete
- Parameterized analysis and crossing minimization problems
- Embedding graphs in cylinder and torus books
This page was built for publication: Embedding planar graphs in four pages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120582)
