Matchings in 3‐vertex‐critical graphs: The even case
From MaRDI portal
Publication:5463670
DOI10.1002/net.20065zbMath1071.05060OpenAlexW4245345621MaRDI QIDQ5463670
Michael D. Plummer, Nawarat Ananchuen
Publication date: 5 August 2005
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20065
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 (11)
3-factor-criticality in double domination edge critical graphs ⋮ Matchings in 3-vertex-critical graphs: the odd case ⋮ Construction for trees without domination critical vertices ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ New results on 3-domination critical graphs ⋮ EveryK1,7andK1,3-free, 3-vertex critical graph of even order has a perfect matching ⋮ 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 ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ Factor-critical property in 3-dominating-critical graphs
Cites Work
This page was built for publication: Matchings in 3‐vertex‐critical graphs: The even case
