Sequences, claws and cyclability of graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199604)21:4<357::AID-JGT1>3.0.CO;2-O" /><357::AID-JGT1>3.0.CO;2-O 10.1002/(SICI)1097-0118(199604)21:4<357::AID-JGT1>3.0.CO;2-OzbMath0849.05045OpenAlexW4248262551MaRDI QIDQ4879172

Feng Tian, Yi-Ping Liu, Evelyne Flandrin, Hao Li, Odile Favaron, Zheng-sheng Wu

Publication date: 5 November 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<357::aid-jgt1>3.0.co;2-o

zbMATH Keywords

cyclabilitydominating cyclesclaw-freehamiltonicityHamiltonian connectednesscyclable sequences

Mathematics Subject Classification ID

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

Related Items (11)

A \(k\)-tree containing specified vertices ⋮ A sufficient condition for cyclability in directed graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Cycles through given vertices and closures ⋮ Relative length of longest paths and cycles in 3-connected 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 ⋮ A new sufficient condition for pancyclability of graphs ⋮ Degree conditions and degree bounded trees ⋮ A look at cycles containing specified elements of a graph

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