Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)

DOI10.1016/S0012-365X(02)00876-2zbMath1022.05054MaRDI QIDQ1408861

Yaojun Chen, Bing Wei, Feng Tian

Publication date: 25 September 2003

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

zbMATH Keywords

domination-critical graphHamilton-connectivity

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items

New results on 3-domination critical graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Codiameters of 3-domination critical graphs with toughness more than one ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)

Cites Work

• Unnamed Item
• Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
• Some properties of 3-domination-critical graphs
• Critical concepts in domination
• Codiameters of 3-connected 3-domination critical graphs
• Hamiltonian properties of domination-critical graphs
• The diameter of domination k‐critical graphs
• Independence and hamiltonicity in 3-domination-critical graphs
• Domination critical graphs