The \(k\)-dominating cycles in graphs

DOI10.1016/j.ejc.2009.03.033zbMath1208.05100OpenAlexW2035989236MaRDI QIDQ966170

Shan Zhou, Hao Li, Guang-Hui Wang

Publication date: 27 April 2010

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.033

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamilton-connected, vertex-pancyclic and bipartite holes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonism, degree sum and neighborhood intersections
• On cycles in 3-connected graphs
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• Cyclability of 3-connected graphs
• Some Theorems on Abstract Graphs

This page was built for publication: The \(k\)-dominating cycles in graphs