Hamiltonicity and minimum degree in 3-connected claw-free graphs (Q1850548): Difference between revisions

@@ Property / DOI @@
-.1006/jctb.2001.2039
@@ Property / DOI: 10.1006/jctb.2001.2039 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jctb.2001.2039
+Normal rank
@@ Property / OpenAlex ID @@
+W1992542849
@@ Property / OpenAlex ID: W1992542849 / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+A nine point theorem for 3-connected graphs
@@ Property / cites work: A nine point theorem for 3-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+When m vertices in a k-connected graph cannot be walked round along a simple cycle
+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 @@
+On a closure concept in claw-free graphs
@@ Property / cites work: On a closure concept in claw-free graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/JCTB.2001.2039
@@ Property / DOI: 10.1006/JCTB.2001.2039 / rank @@
+Normal rank