Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs (Q4920656): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21663
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21663 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1487160767
@@ Property / OpenAlex ID: W1487160767 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
+Normal rank
@@ Property / cites work @@
+A reduction method to find spanning Eulerian subgraphs
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Critical graphs for subpancyclicity of 3-connected claw-free graphs
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Every 3‐connected claw‐free             <i>Z</i>             <sub>8</sub>             ‐free graph is Hamiltonian
+Normal rank
@@ Property / cites work @@
+Claw-free 3-connectedP11-free graphs are hamiltonian
+Normal rank
@@ Property / cites work @@
+Hamiltonian results inK1,3-free graphs
@@ Property / cites work: Hamiltonian results inK1,3-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonicity and forbidden subgraphs in 4‐connected graphs
+Normal rank
@@ Property / cites work @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank