Hamilton-connectivity of 3-domination critical graphs with = + 2
From MaRDI portal
Publication:1864591
Recommendations
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Some properties of 3-domination-critical graphs
- Codiameters of 3-domination critical graphs with toughness more than one
Cites work
- scientific article; zbMATH DE number 1760766 (Why is no real title available?)
- A method in graph theory
- A new proof of Wojcicka's conjecture
- Codiameters of 3-connected 3-domination critical graphs
- Domination critical graphs
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- Independence and connectivity in 3-domination-critical graphs
- Independence and hamiltonicity in 3-domination-critical graphs
Cited in
(8)- A note on domination 3-edge-critical planar graphs
- Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
- scientific article; zbMATH DE number 1760766 (Why is no real title available?)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\)
- scientific article; zbMATH DE number 1472135 (Why is no real title available?)
- Codiameters of 3-domination critical graphs with toughness more than one
- Independence and hamiltonicity in 3-domination-critical graphs
- Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\)
This page was built for publication: Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864591)