4-connected polyhedra have at least a linear number of Hamiltonian cycles (Q2048366): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2021.103395
@@ Property / DOI: 10.1016/j.ejc.2021.103395 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejc.2021.103395
+Normal rank
@@ Property / OpenAlex ID @@
+W3178022067
@@ Property / OpenAlex ID: W3178022067 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q114184727
@@ Property / Wikidata QID: Q114184727 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles in 5-connected triangulations
@@ Property / cites work: Cycles in 5-connected triangulations / 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 @@
+On the number of hamiltonian cycles in triangulations with few separating triangles
+Normal rank
@@ Property / cites work @@
+Polyhedra with few 3-cuts are Hamiltonian
@@ Property / cites work: Polyhedra with few 3-cuts are Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of hamiltonian cycles in a maximal planar graph
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in plane triangulations
@@ Property / cites work: Hamilton cycles in plane triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamilton cycles in certain planar graphs
@@ Property / cites work: On Hamilton cycles in certain planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on paths in planar graphs
@@ Property / cites work: A theorem on paths in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Planar Graphs
@@ Property / cites work: A Theorem on Planar Graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2021.103395
@@ Property / DOI: 10.1016/J.EJC.2021.103395 / rank @@
+Normal rank