Perfect matchings in paired domination vertex critical graphs

DOI10.1007/S10878-010-9368-9zbMath1270.90090OpenAlexW1988321487MaRDI QIDQ437060

Shenwei Huang, Erfang Shan, Li-ying Kang

Publication date: 17 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9368-9

zbMATH Keywords

matchingperfect matchingfactor-criticalpaired domination vertex critical

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Paired Domination in Graphs

Cites Work

• Matching properties in total domination vertex critical graphs
• Paired domination vertex critical graphs
• The diameter of total domination vertex critical graphs
• Bicritical domination
• The diameter of paired-domination vertex critical graphs
• Vertex domination-critical graphs
• Paired-domination in graphs
• Vertex domination‐critical graphs
• Domination critical graphs

This page was built for publication: Perfect matchings in paired domination vertex critical graphs