Title: A nine vertex theorem for 3-connected claw- free graphs
Abstract: It is proved that if G is a 3-connected claw-free graph and if S is a set of vertices in G with j S j 5 9, then G contains a cycle which in turn contains S. This result is sharp.
Publication Year: 2001
Publication Date: 2001-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 10
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot