A new proof of Wojcicka's conjecture (Q1811074): Difference between revisions

A graph \(G\) is 3-domination-critical if its domination number is 3 and the addition of any edge decreases the domination number by 1. In 1990, \textit{E. Wojcicka} [J. Graph Theory 14, 205-215 (1990; Zbl 0702.05058)] conjectured that every 3-domination-critical graph with minimum degree \(\delta\geq 2\) is Hamiltonian. The authors present a new proof of this conjecture.