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

Research output: Contribution to journal › Journal article › Research › peer-review

OpenUrl availability

@article{64163a1284e34227a491d1f390a830e6,

title = "On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese Postman Problen for a planar triangulation",

author = "Carsten Thomassen",

year = "2006",

language = "English",

volume = "53",

pages = "261--269",

journal = "Journal of Graph Theory",

issn = "1097-0118",

publisher = "JohnWiley & Sons, Inc.",

}