๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

NP-completeness of maximum-cut and cycle-covering problems for a planar graph

โœ Scribed by A. P. Terebenkov

Book ID
118289210
Publisher
Springer US
Year
1991
Tongue
English
Weight
462 KB
Volume
27
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
โœ Paul Bonsma ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB

## Abstract The Matchingโ€Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$โ€complete when restricted to graphs with maximum deg

On the max-cut problem for a planar, cub
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
โœ Carsten Thomassen ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 109 KB ๐Ÿ‘ 2 views

## 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. Example