Plane augmentation of plane graphs to meet parity constraints

J.C. Catana, A. García, J. Tejel and J. Urrutia

Applied Mathematics and Computation, 2020, vol. 386, issue C

Abstract: A plane topological graph G=(V,E) is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph G=(V,E) and a set CG of parity constraints, in which every vertex has assigned a parity constraint on its degree, either even or odd, we say that G is topologically augmentable to meet CG if there exists a set E′ of new edges, disjoint with E, such that G′=(V,E∪E′) is noncrossing and meets all parity constraints.

Keywords: Plane topological graphs; Plane geometric graphs; Augmentation problems; Parity constraints; NP-complete problems; Maximal outerplane graphs (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304719
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:386:y:2020:i:c:s0096300320304719

DOI: 10.1016/j.amc.2020.125513

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().