On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation

Carsten Thomassen. On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. Journal of Graph Theory, 53(4):261-269, 2006. [doi]

Abstract

Abstract is missing.