|
Goddard and Henning conjectured that every simple triangulated planar graph on at least four vertices has a 2-coloring such that every vertex has neighbors in both color classes. We give several equivalent and stronger reformulations of the conjecture and present some partial results that might serve as starting points for further investigations.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f and G{\'a}bor, Hanna}, |
| TITLE | = | {Total domatic number of triangulated planar graphs}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2018}, |
| NUMBER | = | {QP-2018-01} |