Matching properties in connected domination critical graphs

DOI10.1016/j.disc.2007.03.073zbMath1132.05043OpenAlexW2060962253MaRDI QIDQ2470003

Watcharaphong Ananchuen, Michael D. Plummer, Nawarat Ananchuen

Publication date: 11 February 2008

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

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

zbMATH Keywords

matchingconnected dominationclaw-freefactor-criticalbicriticalcritical edge3-factor-critical

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (9)

3-factor-criticality in double domination edge critical graphs ⋮ Connected domination in maximal outerplanar graphs ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ Some results related to the toughness of 3-domination critical graphs ⋮ A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ Connected domination critical graphs with a block having maximum number of cut vertices ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ Matching properties in total domination vertex critical graphs ⋮ Connected Domination

Cites Work

• Matching theory
• Matching properties in domination critical graphs.
• Connected domination critical graphs.
• 3-factor-criticality in domination critical graphs
• Connected Domination and Spanning Trees with Many Leaves
• On domination critical graphs with cutvertices having connected domination number 3
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching properties in connected domination critical graphs