New results on 3-domination critical graphs

DOI10.1007/s00010-011-0105-yzbMath1246.05114OpenAlexW2158570868MaRDI QIDQ443927

Adriana Hansberg, Camino Balbuena

Publication date: 13 August 2012

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-011-0105-y

zbMATH Keywords

independencedominationvertex-connectivity3-domination criticaldomination critical graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
• Some properties of 3-domination-critical graphs
• Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• Independence and connectivity in 3-domination-critical graphs
• Hamiltonian properties of domination-critical graphs
• Independence and hamiltonicity in 3-domination-critical graphs
• Matchings in 3‐vertex‐critical graphs: The even case
• Domination critical graphs

This page was built for publication: New results on 3-domination critical graphs