Vertex pancyclicity of quadrangularly connected claw-free graphs

DOI10.1007/S00373-015-1528-3zbMATH Open1346.05140OpenAlexW1967794626MaRDI QIDQ897270

Xin Ma, Xiao Dong Chen, Ming-Chu Li

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-015-1528-3

zbMATH Keywords

claw-free graphvertex pancyclicquadrangularly connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles of given length in some \(K_{1,3}\)-free graphs
• Quadrangularly connected claw-free graphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs

Related Items (2)

Unnamed Item ⋮ The square of a connected S(K1,3)-free graph is vertex pancyclic

This page was built for publication: Vertex pancyclicity of quadrangularly connected claw-free graphs