Degree sums, connectivity and dominating cycles in graphs
From MaRDI portal
Publication:5952392
DOI10.1007/PL00013415zbMath1010.05052MaRDI QIDQ5952392
Feng Tian, Zhi-ren Sun, Bing Wei
Publication date: 9 January 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Large cycles in 4-connected graphs ⋮ Degree sum and connectivity conditions for dominating cycles ⋮ A note on a cycle partition problem ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles
This page was built for publication: Degree sums, connectivity and dominating cycles in graphs
