The structure of \(4-\gamma \)-critical graphs with a cut vertex

DOI10.1016/J.DISC.2010.05.029zbMath1210.05091OpenAlexW1968784647MaRDI QIDQ708397

R. E. L. Aldred, Nawarat Ananchuen, Watcharaphong Ananchuen

Publication date: 11 October 2010

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

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

zbMATH Keywords

dominationedge-critical graph

Mathematics Subject Classification ID

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

Related Items (1)

Matching of \(5-\gamma \)-critical leafless graph with a cut edge

Cites Work

• Some results related to the toughness of 3-domination critical graphs
• Matching properties in domination critical graphs.
• A new proof of Wojcicka's conjecture
• 3-factor-criticality in domination critical graphs
• Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
• Hamiltonian properties of domination-critical graphs
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The structure of \(4-\gamma \)-critical graphs with a cut vertex