Sequences, claws and cyclability of graphs

DOI10.1002/(SICI)1097-0118(199604)21:4%3C357::AID-JGT1%3E3.0.CO;2-OMaRDI QIDQ4879172zbMATH OpenOpenAlexFDO

Authors Evelyne Flandrin, Hao Li, Yiping Liu, Feng Tian, Odile Favaron, Zhengsheng Wu

Publication date 5 November 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199604)21:4%3C357::aid-jgt1%3E3.0.co;2-o

zbMATH Keywords

claw-freecyclabilitycyclable sequencesdominating cyclesHamiltonian connectednesshamiltonicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 1823784
• Cyclic matching sequencibility of graphs
• scientific article; zbMATH DE number 7268038
• Cycles through particular subgraphs of claw‐free graphs
• scientific article; zbMATH DE number 5274215
• Pancyclicity in claw-free graphs
• Cycle traversability for claw-free graphs and polyhedral maps
• scientific article; zbMATH DE number 3985265
• Graphic sequences that have a realization with large clique number
• scientific article; zbMATH DE number 3940217

Cited in

(13)

• Degree conditions and degree bounded trees
• A look at cycles containing specified elements of a graph
• Cycles through given vertices and closures
• Relative length of longest paths and cycles in 3-connected graphs
• Cyclic matching sequencibility of graphs
• Cycles in squares of trees without generalized claws
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• A \(k\)-tree containing specified vertices
• A new sufficient condition for pancyclability of graphs
• A sufficient condition for cyclability in directed graphs
• Hamiltonicity of 4-connected graphs
• Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
• A sufficient condition for pancyclability of graphs

This page was built for publication: Sequences, claws and cyclability of graphs

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