Full cycle extendability of nearly claw-free graphs.

zbMATH Open1413.05198MaRDI QIDQ2829054FDOQ2829054

Authors: Mingquan Zhan, Shuxin Zhan 

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Full cycle extendability of triangularly connected almost claw-free graphs.
• scientific article; zbMATH DE number 5371683
• scientific article; zbMATH DE number 147629
• On cycle lengths in claw-free graphs with complete closure
• Path extendability of claw-free graphs
• Longest cycles in almost claw-free graphs
• Pancyclicity in claw-free graphs
• On pancyclic claw-free graphs
• scientific article; zbMATH DE number 1322577
• scientific article; zbMATH DE number 147642

zbMATH Keywords

line graphHamiltonian connectedfull cycle extendabilitynearly claw-free graphstriangularly connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cited In (7)

• Title not available (Why is that?)
• On \(s\)-fully cycle extendable line graphs
• On cycle-nice claw-free graphs
• Full cycle extendability of triangularly connected almost claw-free graphs.
• Title not available (Why is that?)
• Quadrangularly connected claw-free graphs
• Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs

This page was built for publication: Full cycle extendability of nearly claw-free graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829054)