On Rall's 1/2-conjecture on the domination game
On Rall's 1/2-conjecture on the domination game
The 1/2-conjecture on the domination game asserts that if G is a traceable graph, then the game domination number γg (G) of G is at most A traceable graph is a 1/2-graph if holds. It is proved that the so-called hatted cycles are 1/2-graphs and that unicyclic graphs fulfill the …