On Hamiltonian claw-free graphs (Q686468): Difference between revisions

It is shown that every 3-connected claw-free graph of order at most \(5d- 10\) contains a Hamilton circuit, where \(d\) is the minimum degree of the graph. This result partially generalizes a result of the reviewer [J. Graph Theory 12, No. 2, 209-216 (1988; Zbl 0642.05037)] for 3-connected graphs.

0 references

Mathematics Subject Classification ID

05C45

0 references

0 references

0 references

claw-free graph

0 references

Hamilton circuit

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5422499

0 references

Hamilton cycles in claw-free graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:686468

@@ Property / author @@
-Evelyne Flandrin
@@ Property / author: Evelyne Flandrin / rank @@
-Normal rank
@@ Property / author @@
-Jean-Luc Fouquet
@@ Property / author: Jean-Luc Fouquet / rank @@
-Normal rank
@@ Property / author @@
+Evelyne Flandrin
@@ Property / author: Evelyne Flandrin / rank @@
+Normal rank
@@ Property / author @@
+Jean-Luc Fouquet
@@ Property / author: Jean-Luc Fouquet / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamilton cycles in claw-free graphs
@@ Property / cites work: Hamilton cycles in claw-free graphs / rank @@
+Normal rank