3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-013-1344-6
@@ Property / DOI: 10.1007/s00373-013-1344-6 / rank @@
-Normal rank
@@ Property / author @@
+Paul S. Horn
@@ Property / author: Paul S. Horn / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-013-1344-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2004434341
@@ Property / OpenAlex ID: W2004434341 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs that imply hamiltonian‐connectedness*
+Normal rank
@@ Property / cites work @@
+-connected claw-free graphs are Hamilton-connected
+Normal rank
@@ Property / cites work @@
+Q4350166
@@ Property / cites work: Q4350166 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500611
@@ Property / cites work: Q4500611 / rank @@
+Normal rank
@@ Property / cites work @@
+On Forbidden Pairs Implying Hamilton‐Connectedness
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+On graph closures
@@ Property / cites work: On graph closures / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonicity in claw-free graphs
@@ Property / cites work: Hamiltonicity in claw-free graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-013-1344-6
@@ Property / DOI: 10.1007/S00373-013-1344-6 / rank @@
+Normal rank