The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Bookmark and Share
All 2-Connected Claw-Free Graphs with Diameter at Most TWO are Hamiltonian
Pages: 19-24
Year: Issue:  4
Journal: Operations Research Transactions

Keyword:  Operations researchline graphsclaw-free graphsclosed trailHamilton cycle;
Abstract: A graph iS called 2K2-free if it does not contain an independent pair of edges as an induced subgraph.Kriesell proved that all 4-connected line graphs of graph axe Hamiltonian-connected.Motivated from this,in this note,we show that if G is 2K2-free and is not isomorphic to K2,P3 or a double star,then the line graph L(G)isHamiltonian.Moreover,by applying the closure concept of claw-free graphs introduced byby Ainouche et al.,which says that every 2-connected claw-free graph of diameter at most 2 is Hamiltonian.
Related Articles
No related articles found