Embeddings of planar graphs that minimize the number of long-face cycles

Authors:
Gerhard J Woeginger
Affiliations:
Faculty of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Venue:
Operations Research Letters
Year:
2002

Citing 2
Cited 0

Face covers and the genus problem for Apex graphs

Journal of Combinatorial Theory Series B
Optimizing over All Combinatorial Embeddings of a Planar Graph

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding embeddings of planar graphs that minimize the number of long-face cycles. We prove that for any k=4, it is NP-complete to find an embedding that minimizes the number of face cycles of length at least k.