Degree sum and connectivity conditions for dominating cycles

DOI10.1016/j.disc.2007.04.019zbMath1135.05014OpenAlexW2090130267MaRDI QIDQ2477385

Tomoki Yamashita

Publication date: 13 March 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.019

zbMATH Keywords

connectivitydegree sumdominating cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

A note on a cycle partition problem ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles

Cites Work

• A generalization of a result of Häggkvist and Nicoghossian
• A remark on Hamiltonian cycles
• Two sufficient conditions for dominating cycles
• Note on Hamilton Circuits
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Degree sums, connectivity and dominating cycles in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Degree sum and connectivity conditions for dominating cycles