Cycles of given length in some K₁,3-free graphs

DOI10.1016/0012-365X(89)90186-6MaRDI QIDQ749554zbMATHFDO

Authors 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) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4108813
• scientific article; zbMATH DE number 1185308
• scientific article; zbMATH DE number 1187330
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 1744073

Cites work

• 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
• On maximal independent sets of vertices in claw-free graphs

Cited in

(13)

• scientific article; zbMATH DE number 4108813 (Why is no real title available?)
• Claw-free graphs---a survey
• Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
• Vertex pancyclicity of quadrangularly connected claw-free graphs
• Panconnectivity of locally connected claw-free graphs
• Pancyclicity modulo 5 of \(K_{1,4}\)-free graphs
• Vertex pancyclicity in quasi claw-free graphs
• Hamiltonian properties of locally connected graphs with bounded vertex degree
• Vertex pancyclicity in quasi-claw-free graphs
• Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
• Hamiltonian connectedness in claw-free graphs
• Modification of \(CZ_3\)-free condition to have a cycle containing specified vertices
• Long cycles and 3-connected spanning subgraphs of bounded degree in 3- connected \(K_{1,d}\)-free graphs

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

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