|
Shafique and Dutton proved that every simple triangle-free Eulerian graph has a friendly partition. We give a simple algorithmic proof for the state- ment in planar graphs. The proof also implies that every triangle-free planar graph has a weak internal partition.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f and Paulovics, Zolt{\'a}n}, |
| TITLE | = | {Triangle-free Eulerian planar graphs are friendly}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2018}, |
| NUMBER | = | {QP-2018-02} |