Independence and connectivity in 3-domination-critical graphs

DOI10.1016/S0012-365X(02)00383-7zbMath1015.05063OpenAlexW1984672596MaRDI QIDQ1861215

Feng Tian, Lian Zhu Zhang

Publication date: 16 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00383-7

zbMATH Keywords

independence numberconnectivityHamilton path\(3\)-domination-critical graph

Mathematics Subject Classification ID

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

Related Items (4)

New results on 3-domination critical graphs ⋮ Unnamed Item ⋮ A new proof of Wojcicka's conjecture ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)

This page was built for publication: Independence and connectivity in 3-domination-critical graphs