Largest cycles in 2-connected claw-free graphs

Largest cycles in 2-connected claw-free graphs

0.00 Avg rating—0 Votes
Article ID: iaor19981825
Country: China
Volume: 10
Issue: 2
Start Page Number: 176
End Page Number: 182
Publication Date: Apr 1997
Journal: Journal of Systems Science and Complexity
Authors: , ,
Abstract:

Matthews and Sumner proved that if G is a 2-connected claw-free graph of order n, then c(G) ≥ min {2δ+4, n}. In this paper, the authors prove that if G is a 2-connected claw-free graph on n vertices, then c(G) ≥ min {3δ+2, n} or G belongs to one exceptional class of graphs.

Reviews

Required fields are marked *. Your email address will not be published.