Recognizing a totally odd K4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements

  • Authors:

  • Ken-ichi Kawarabayashi;Zhentao Li;Bruce Reed

  • Affiliations:

  • National Institute of Informatics, Chiyoda-ku, Tokyo, Japan and Japan Society for the Promotion of Science;McGill University, Montreal, Canada;McGill University, Montreal, Canada

  • Venue:
  • SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A totally odd K4-subdivision is a subdivision of K4 where each subdivided edge has odd length. The recognition of a totally odd K4-subdivision plays an important role in both graph theory and combinatorial optimization. Sewell and Trotter [53], Zang [63] and Thomassen [60] independently conjectured the existence of a polynomial time recognition algorithm. In this paper, we give the first polynomial time algorithm for solving this problem. We also study the the parity two disjoint rooted paths problem where we determine if there exists two vertex disjoint paths of a specified parity between two pairs of terminals. Using a similar technique, we give an O(|E(G)||V(G)|α(|E(G)|,|V(G)|)) algorithm for the parity two disjoint rooted paths problem on an input graph G, where α(|E(G)|,|V(G)|) is the inverse of the Ackermann function. We note that this clearly gives an algorithm for the well-known non-parity version of the two disjoint rooted paths problem [19, 50, 52, 55, 58]. We then extend our approach to give a polynomial time algorithm which determines, for any fixed k, whether there exists a cycle of a given parity through k independent input edges. This generalizes the non-parity version of the algorithm in [22]. Thomassen [61] gave a polynomial algorithm for the case k = 2 and hoped to use this algorithm to recognize a totally odd K4-subdivision. Our algorithm runs in O(|E(G)||V(G)|α(|E(G)|,|V(G)|)) for any fixed k. Finally, we give an O(|V(G)|2 + |E(G)|α(|E(G)|,|V(G)|log|V(G)|)) algorithm to decide whether a graph contains k disjoint paths from A to B (with |A| = |B| = k) that are not all of the same parity. This answers a conjecture of Thomassen [60]. This problem arises from the study of totally odd-K4-subdivisions in 3-connected graphs [60].