Cycles of given length in some \(K_{1,3}\)-free graphs

DOI10.1016/0012-365X(89)90186-6zbMath0713.05042MaRDI QIDQ749554

Cun-Quan Zhang

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclesvertex pancyclic

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian

Related Items (10)

Claw-free graphs---a survey ⋮ Unnamed Item ⋮ Vertex pancyclicity in quasi claw-free graphs ⋮ Vertex pancyclicity of quadrangularly connected claw-free graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ Hamiltonian connectedness in claw-free graphs ⋮ Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability ⋮ Unnamed Item ⋮ Vertex pancyclicity in quasi-claw-free graphs ⋮ Panconnectivity of locally connected claw-free graphs

This page was built for publication: Cycles of given length in some \(K_{1,3}\)-free graphs