EveryK1,7andK1,3-free, 3-vertex critical graph of even order has a perfect matching

DOI10.1080/09720529.2010.10698316zbMath1218.05139OpenAlexW2324458993MaRDI QIDQ3008565

Adel P. Kazemi

Publication date: 22 June 2011

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: http://www.connectjournals.com/file_html_pdf/899906H_jdmsc373_583-591A.pdf

zbMATH Keywords

perfect matchingvertex-critical graph

Mathematics Subject Classification ID

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

Related Items (1)

Construction for trees without domination critical vertices

Cites Work

• Critical concepts in domination
• Vertex domination-critical graphs
• Vertex domination‐critical graphs
• Matchings in 3‐vertex‐critical graphs: The even case

This page was built for publication: EveryK_1,7andK_1,3-free, 3-vertex critical graph of even order has a perfect matching