Opening book details…
Can I read On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation on EtoBox?
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation by Carsten Thomassen is a Computer Science article available to read on EtoBox.
What is On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation about?
## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24 − 7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Examples show that the constant 29/24 = 1.2083... cannot be raised to more than 47/38 = 1.2368.... © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 261–269, 2006
Who reads On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Carsten Thomassen
- Publisher
- John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)