Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs

DOI10.1016/j.disc.2010.04.018zbMath1225.05148OpenAlexW2007994029MaRDI QIDQ709323

Hao Li, Evelyne Flandrin, Ervin Gyoeri, Jin-Long 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

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

Mathematics Subject Classification ID

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

Related Items (1)

Cycle traversability for claw-free graphs and polyhedral maps

Cites Work

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

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