Login / Signup

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

Carsten Thomassen
Published in: J. Graph Theory (2006)
Keyphrases
  • planar graphs
  • max cut
  • b spline
  • graph theory
  • ground plane
  • curved surfaces
  • random graphs
  • special case
  • directed graph
  • directed acyclic graph
  • planar surfaces
  • single point
  • waveguide