Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs

DOI10.1016/j.camwa.2009.10.024zbMath1189.05146OpenAlexW2063019779MaRDI QIDQ980258

Erfang Shan, Hai-Chao Wang

Publication date: 28 June 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.10.024

zbMATH Keywords

matchingclaw-freebicriticaldouble domination edge critical graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

3-factor-criticality in double domination edge critical graphs ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending matchings in claw-free graphs
• A note on Nordhaus-Gaddum inequalities for domination.
• Characterizations of trees with equal paired and double domination numbers
• On k-factor-critical graphs