Matching properties in domination critical graphs.
From MaRDI portal
Publication:1426104
DOI10.1016/S0012-365X(03)00243-7zbMath1033.05076MaRDI QIDQ1426104
Michael D. Plummer, Nawarat Ananchuen
Publication date: 14 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
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 (16)
A note on domination 3-edge-critical planar graphs ⋮ Matchings in 3-vertex-critical graphs: the odd case ⋮ Matching of \(5-\gamma \)-critical leafless graph with a cut edge ⋮ On the Structure of Graphs Vertex Critical with Respect to Connected Domination ⋮ New results on 3-domination critical graphs ⋮ A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical ⋮ A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical ⋮ 3-factor-criticality in domination critical graphs ⋮ Matching properties in connected domination critical graphs ⋮ MATCHING PROPERTIES IN DOUBLE DOMINATION EDGE CRITICAL GRAPHS ⋮ Matching properties in total domination vertex critical graphs ⋮ Some notes on domination edge critical graphs ⋮ The structure of \(4-\gamma \)-critical graphs with a cut vertex ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ On an open problem concerning total domination critical graphs ⋮ On the total domination critical graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching theory
- On n-extendable graphs
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Some properties of 3-domination-critical graphs
- Extending matchings in claw-free graphs
- Some results related to the toughness of 3-domination critical graphs
- Hamiltonian properties of domination-critical graphs
- Independence and hamiltonicity in 3-domination-critical graphs
- Domination critical graphs
This page was built for publication: Matching properties in domination critical graphs.