Some results related to the toughness of 3-domination critical graphs
From MaRDI portal
Publication:1415537
DOI10.1016/S0012-365X(03)00179-1zbMath1029.05110MaRDI QIDQ1415537
Michael D. Plummer, Nawarat Ananchuen
Publication date: 4 December 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (11)
A note on domination 3-edge-critical planar graphs ⋮ 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 ⋮ Matching properties in domination critical graphs. ⋮ A characterization of \(3\)-\(\gamma\)-critical graphs which are not bicritical ⋮ 3-factor-criticality in domination critical graphs ⋮ Some notes on domination edge critical graphs ⋮ The structure of \(4-\gamma \)-critical graphs with a cut vertex ⋮ Connected Domination
Cites Work
This page was built for publication: Some results related to the toughness of 3-domination critical graphs
