×

zbMATH — the first resource for mathematics

Finding a maximum cut of a planar graph in polynomial time. (English) Zbl 0321.05120

MSC:
05C35 Extremal problems in graph theory
05C10 Planar graphs; geometric and topological aspects of graph theory
94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010)
PDF BibTeX XML Cite
Full Text: DOI