Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Carsten Thomassen (2006)

> Home

Details and statistics

DOI: 10.1002/JGT.20178

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Thomassen06a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Thomassen06a
Carsten Thomassen:
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. J. Graph Theory 53(4): 261-269 (2006)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.