Two sufficient conditions for dominating cycles
From MaRDI portal
Publication:3022735
DOI10.1002/jgt.20070zbMath1064.05114OpenAlexW4255076054MaRDI QIDQ3022735
Feng Tian, Huiqing Liu, Mei Lu
Publication date: 30 June 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20070
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (11)
Relative length of longest paths and cycles in graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ Degree sums and dominating cycles ⋮ Degree sum and connectivity conditions for dominating cycles ⋮ The \(k\)-dominating cycles in graphs ⋮ Hamiltonicity of 4-connected graphs ⋮ Graph invariants and large cycles: a survey ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ Dirac-type generalizations concerning large cycles in graphs ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles
Cites Work
This page was built for publication: Two sufficient conditions for dominating cycles
