Pages that link to "Item:Q1120582"

The following pages link to Embedding planar graphs in four pages (Q1120582):

Displaying 50 items.

• Embedding generalized Petersen graph in books (Q295940) (← links)
• Two-page book embeddings of 4-planar graphs (Q300468) (← links)
• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• Graph layouts via layered separators (Q473100) (← links)
• On the queue-number of graphs with bounded tree-width (Q521397) (← links)
• Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
• The pagenumber of the class of bandwidth-k graphs is \(k-1\) (Q672400) (← links)
• Curve-constrained drawings of planar graphs (Q706719) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
• On simultaneous planar graph embeddings (Q857060) (← links)
• RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
• Finding Hamiltonian cycles in certain planar graphs (Q916416) (← links)
• Improved book-embeddings of incomplete hypercubes (Q1028113) (← links)
• Embedding the incomplete hypercube in books (Q1044693) (← links)
• Equipartitions of graphs (Q1182860) (← links)
• Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
• Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph (Q1304472) (← links)
• Embedding de Bruijn, Kautz and shuffle-exchange networks in books (Q1377659) (← links)
• The pagenumber of toroidal graphs is at most seven (Q1377749) (← links)
• 1-page and 2-page drawings with bounded number of crossings per edge (Q1678086) (← links)
• Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
• The longest common subsequence problem for sequences with nested arc annotations. (Q1872715) (← links)
• Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
• Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
• Structural properties of subdivided-line graphs (Q2018541) (← links)
• On mixed linear layouts of series-parallel graphs (Q2087464) (← links)
• Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
• A survey on book-embedding of planar graphs (Q2141323) (← links)
• Stack-number is not bounded by queue-number (Q2151179) (← links)
• On the queue number of planar graphs (Q2151450) (← links)
• The mixed page number of graphs (Q2167907) (← links)
• Parameterized analysis and crossing minimization problems (Q2172859) (← links)
• Embedding planar 5-graphs in three pages (Q2185736) (← links)
• Planar graphs that need four pages (Q2200923) (← links)
• Parameterized algorithms for book embedding problems (Q2206870) (← links)
• Local and union page numbers (Q2206876) (← links)
• Mixed linear layouts: complexity, heuristics, and experiments (Q2206878) (← links)
• Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
• Book embedding of complex network with community structure (Q2279645) (← links)
• On exteriority notions in book embeddings and treewidth (Q2297721) (← links)
• On certain Hamiltonian inner triangulations (Q2367404) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• Layered separators in minor-closed graph classes with applications (Q2407382) (← links)
• The book thickness of 1-planar graphs is constant (Q2408921) (← links)
• Succinct representation of labeled graphs (Q2428673) (← links)
• Bijections for Baxter families and related objects (Q2431261) (← links)
• Book drawings of complete bipartite graphs (Q2440102) (← links)
• Planar graphs, via well-orderly maps and trees (Q2502033) (← links)
• Book embedding of locally planar graphs on orientable surfaces (Q2629277) (← links)