Cyclability in k-connected K₁,4-free graphs

DOI10.1016/J.DISC.2010.04.018MaRDI QIDQ709323zbMATH OpenOpenAlexFDO

Authors Evelyne Flandrin, Hao Li, Ervin Győri, Jinlong Shu

Publication date 18 October 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2010.04.018

zbMATH Keywords

\(k\)-connected graph\(K_{1,4}\)-free graphcyclabilitysubset of vertices

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 5371443
• Cycle-connected graphs
• Cycles and paths through specified vertices
• scientific article; zbMATH DE number 4014757
• On hamiltonian connectedness of \(K_{1,4}\)-free graphs

Cites work

• A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs
• A nine vertex theorem for 3-connected claw- free graphs
• Graph theory
• Hamiltonian results inK1,3-free graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Reflections on graph theory
• Some Theorems on Abstract Graphs

Cited in

(7)

• Cycle-connected graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Connectivity of abelian Cayley graphs containing no K₄
• The number of 4-cycles in triangle-free oriented graphs
• Cycle traversability for claw-free graphs and polyhedral maps
• scientific article; zbMATH DE number 4014757 (Why is no real title available?)
• scientific article; zbMATH DE number 1051274 (Why is no real title available?)

This page was built for publication: Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs

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