Angle Covers: Algorithms and Complexity

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an \emph{angle cover} maps every vertex to a pair of consecutive edges in the ordering -- an \emph{angle} -- such that each edge participates in at least one such pair. We show that any graph of maximum degree 4 admits an angle cover, give a poly-time algorithm for deciding if a graph with no degree-3 vertices has an angle-cover, and prove that, given a graph of maximum degree 5, it is NP-hard to decide whether it admits an angle cover. We also consider extensions of the angle cover problem where every vertex selects a fixed number $a>1$ of angles or where an angle consists of more than two consecutive edges. We show an application of angle covers to the problem of deciding if the 2-blowup of a planar graph has isomorphic thickness 2.

[1]  Lebrecht Henneberg,et al.  Die graphische Statik der Starren Systeme , 1911 .

[2]  Günter Rote,et al.  Planar minimally rigid graphs and pseudo-triangulations , 2005, Comput. Geom..

[3]  Ileana Streinu,et al.  A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[4]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[5]  Evans William,et al.  Angle Covers: Algorithms and Complexity , 2020 .

[6]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[7]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[8]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[9]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[11]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[12]  Paul C. Kainen,et al.  Thickness and coarseness of graphs , 1973 .