Two-page book embeddings of 4-planar graphs (Q300468): Difference between revisions

@@ Property / OpenAlex ID @@
+W2100223096
@@ Property / OpenAlex ID: W2100223096 / rank @@
+Normal rank
@@ Property / cites work @@
+The book thickness of a graph
@@ Property / cites work: The book thickness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Any maximal planar graph with only one separating triangle is Hamiltonian
+Normal rank
@@ Property / cites work @@
+The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
+Normal rank
@@ Property / cites work @@
+Q4667610
@@ Property / cites work: Q4667610 / rank @@
+Normal rank
@@ Property / cites work @@
+Each maximal planar graph with exactly two separating triangles is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Extension of a theorem of Whitney
@@ Property / cites work: Extension of a theorem of Whitney / rank @@
+Normal rank
@@ Property / cites work @@
+Q3129827
@@ Property / cites work: Q3129827 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on graphs
@@ Property / cites work: A theorem on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs in four pages
@@ Property / cites work: Embedding planar graphs in four pages / rank @@
+Normal rank