Some matching properties in 4-_ 2-critical graphs
From MaRDI portal
Publication:980258
Recommendations
- Matchings in \(4\)-total restrained domination vertex critical graphs.
- On \(4\)-\(\gamma_t\)-critical graphs of diameter two
- On 4-\gamma_t-critical graphs of order 4+\Delta(G)
- On 4-\(\gamma_c\)-critical graphs with cut-vertices
- Matching properties in total domination vertex critical graphs
- Matching properties in connected domination critical graphs
- The structure of \(4-\gamma \)-critical graphs with a cut vertex
- scientific article; zbMATH DE number 5656434
- The \(k\)-critical \(2k\)-connected graphs for \(k\in\{3,4\}\)
- \(4_t\)-critical graphs with maximum diameter
Cites work
- scientific article; zbMATH DE number 1792607 (Why is no real title available?)
- scientific article; zbMATH DE number 2188616 (Why is no real title available?)
- A note on Nordhaus-Gaddum inequalities for domination.
- Characterizations of trees with equal paired and double domination numbers
- Extending matchings in claw-free graphs
- Graph theory
- Independent and double domination in trees
- On \(k\)-factor-critical graphs
Cited in
(4)
This page was built for publication: Some matching properties in \(4-\gamma_{\times 2}\)-critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980258)