
Domination in cubic graphs
Problem Does every 3-connected cubic graph
satisfy
?


If the girth of is sufficiently large, then
[KSV].
Bibliography
[KSV] Daniel Kral, Petr Skoda, Jan Volec: Domination number of cubic graphs with large girth
* indicates original appearance(s) of problem.