On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (Q2825481): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21915
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21915 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1770335600
@@ Property / OpenAlex ID: W1770335600 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4882477
@@ Property / cites work: Q4882477 / rank @@
+Normal rank
@@ Property / cites work @@
+House of Graphs: a database of interesting graphs
@@ Property / cites work: House of Graphs: a database of interesting graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3548359
@@ Property / cites work: Q3548359 / rank @@
+Normal rank
@@ Property / cites work @@
+Any maximal planar graph with only one separating triangle is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in plane triangulations
@@ Property / cites work: Hamilton cycles in plane triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on graphs
@@ Property / cites work: A theorem on graphs / rank @@
+Normal rank