A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical

DOI10.1007/s00373-010-0920-2zbMath1219.05072OpenAlexW2080481684MaRDI QIDQ1959715

Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta

Publication date: 7 October 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0920-2

zbMATH Keywords

critical graphconnected dominationclaw-free

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Connected Domination

Cites Work

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

This page was built for publication: A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical