Hamiltonicity in 3-domination-critical graphs with \(\alpha= \delta+2\)
From MaRDI portal
Publication:1283070
DOI10.1016/S0166-218X(98)00149-8zbMath0916.05038OpenAlexW2093743709MaRDI QIDQ1283070
Lei Zhang, Feng Tian, Bing Wei
Publication date: 7 July 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00149-8
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items
Traceability of connected domination critical graphs ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ Hamilton-connectivity of 3-domination-critical graphs with \(\alpha \leqslant\delta\) ⋮ New results on 3-domination critical graphs ⋮ Matching properties in domination critical graphs. ⋮ The maximum diameter of total domination edge-critical graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha =\delta +1\geqslant 5\) ⋮ Properties of total domination edge-critical graphs ⋮ Codiameters of 3-connected 3-domination critical graphs ⋮ A conjecture on \(k\)-factor-critical and 3-\(\gamma \)-critical graphs ⋮ A new proof of Wojcicka's conjecture ⋮ Some properties of 3-domination-critical graphs ⋮ Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
Cites Work
