Matchings in 3-vertex-critical graphs: the odd case

DOI10.1016/j.disc.2006.09.015zbMath1133.05073OpenAlexW2090169885MaRDI QIDQ879342

Michael D. Plummer, Nawarat Ananchuen

Publication date: 11 May 2007

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

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

zbMATH Keywords

matchingdominationfactor-critical3-vertex-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 (7)

3-factor-criticality in double domination edge critical graphs ⋮ Construction for trees without domination critical vertices ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ A characterization of domination weak bicritical graphs with large diameter ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ Matching properties in total domination vertex critical graphs ⋮ Factor-critical property in 3-dominating-critical graphs

Cites Work

• Unnamed Item
• Matching theory
• Matching properties in domination critical graphs.
• Vertex domination-critical graphs
• 1-Factors and Antifactor Sets
• Vertex domination‐critical graphs
• Matchings in 3‐vertex‐critical graphs: The even case

This page was built for publication: Matchings in 3-vertex-critical graphs: the odd case