AffiliationUniv Arizona, Dept Comp Sci
MetadataShow full item record
CitationAngelini, P., Eades, P., Hong, S. H., Klein, K., Kobourov, S., Liotta, G., ... & Tappini, A. (2020). Graph Planarity by Replacing Cliques with Paths. Algorithms, 13(8), 194.
Rights© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractThis paper introduces and studies the following beyond-planarity problem, which we call h-CLIQUE2PATH PLANARITY. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-CLIQUE2PATH PLANARITY asks whether it is possible to obtain a planar subgraph of G by removing edges from each clique so that the subgraph induced by each subset is a path. We investigate the complexity of this problem in relation to k-planarity. In particular, we prove that h-CLIQUE2PATH PLANARITY is NP-complete even when h = 4 and G is a simple 3-plane graph, while it can be solved in linear time when G is a simple 1-plane graph, for any value of h. Our results contribute to the growing fields of hybrid planarity and of graph drawing beyond planarity.
NoteOpen access journal
VersionFinal published version
Except where otherwise noted, this item's license is described as © 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).