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

researchr

You are not signed in
Sign in
Sign up

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]

No references recorded for this publication.

No citations of this publication recorded.

runs on WebDSL