Strengthening Hardness Results to 3-Connected Planar Graphs
Computational Complexity
2016-07-11 v1 Computational Geometry
Combinatorics
Abstract
In this paper we extend some classical NP-hardness results from the class of 2-connected planar graphs to subclasses of 3-connected planar graphs. The reduction are partly based on a new graph augmentation, which may be of independent interest.
Keywords
Cite
@article{arxiv.1607.02346,
title = {Strengthening Hardness Results to 3-Connected Planar Graphs},
author = {Giordano Da Lozzo and Ignaz Rutter},
journal= {arXiv preprint arXiv:1607.02346},
year = {2016}
}