MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS

DOI10.1142/S1793830910000541zbMath1214.05109MaRDI QIDQ3575371

Hai-Chao Wang, Li-ying Kang

Publication date: 27 July 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

matchingfactor-criticaldouble domination edge critical graphs

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 (2)

3-factor-criticality in double domination edge critical graphs ⋮ Hamiltonicities of double domination critical and stable claw-free graphs

Cites Work

• Unnamed Item
• Matchings in 3-vertex-critical graphs: the odd case
• The upper bound on \(k\)-tuple domination numbers of graphs
• The \(k\)-tuple domination number revisited
• Proof of a conjecture on \(k\)-tuple domination in graphs
• Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Factor-critical property in 3-dominating-critical graphs
• \(k\)-tuple domination in graphs
• Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
• Matching properties in domination critical graphs.
• Nordhaus-Gaddum inequalities for domination in graphs
• 3-factor-criticality in domination critical graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Matching properties in connected domination critical graphs
• A generalised upper bound for the \(k\)-tuple domination number
• Matchings in 3‐vertex‐critical graphs: The even case

This page was built for publication: MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS