Hamilton circuits and essential girth of claw free graphs (Q5964993): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-015-1559-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2005291216
@@ Property / OpenAlex ID: W2005291216 / rank @@
+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
@@ Property / cites work @@
+On factors of 4-connected claw-free graphs
@@ Property / cites work: On factors of 4-connected claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3211339
@@ Property / cites work: Q3211339 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonicity of generalized net-free graphs of large diameter
+Normal rank
@@ Property / cites work @@
+Induced nets and Hamiltonicity of claw-free graphs
+Normal rank
@@ Property / cites work @@
+Q3918148
@@ Property / cites work: Q3918148 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838206
@@ Property / cites work: Q3838206 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs and Hamiltonian properties and graphs
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Hourglasses and Hamilton cycles in 4‐connected claw‐free 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 @@
+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