Two sufficient conditions for dominating cycles
From MaRDI portal
Publication:3022735
DOI10.1002/jgt.20070zbMath1064.05114MaRDI QIDQ3022735
Feng Tian, Mei Lu, Huiqing Liu
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
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Graph invariants and large cycles: a survey, The \(k\)-dominating cycles in graphs, Hamiltonicity of 4-connected graphs, 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, Relative length of longest paths and cycles in graphs, Degree sum and connectivity conditions for dominating cycles
Cites Work