The Parity Hamiltonian Cycle Problem in Directed Graphs

  • Hiroshi Nishiyama
  • Yukiko Yamauchi
  • Shuji Kijima
  • Masafumi Yamashita
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9849)

Abstract

This paper investigates a variant of the Hamiltonian cycle, the parity Hamiltonian cycle (PHC) problem: a PHC in a directed graph is a closed walk (possibly using an arc more than once) which visits every vertex odd number of times. Nishiyama et al. (2015) investigated the undirected version of the PHC problem, and gave a simple characterization that a connected undirected graph has a PHC if and only if it has even order or it is non-bipartite. This paper gives a complete characterization when a directed graph has a PHC, and shows that the PHC problem in a directed graph is solved in polynomial time. The characterization, unlike with the undirected case, is described by a linear system over GF(2).

Keywords

Hamiltonian cycle T-joins Linear system over GF(2) 

References

  1. 1.
    Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer, London (2008)MATHGoogle Scholar
  2. 2.
    Biggs, N., Lloyd, E., Wilson, R.: Graph Theory 1736–1936. Oxford University Press, Oxford (1986)MATHGoogle Scholar
  3. 3.
    Boyd, S., Iwata, S., Takazawa, K.: Finding 2-factors closer to TSP tours in cubic graphs. SIAM J. Discrete Math. 27, 918–939 (2013)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Boyd, S., Sitters, R., van der Ster, S., Stougie, L.: TSP on cubic and subcubic graphs. In: Günlük, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 65–77. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Brigham, R.C., Dutton, R.D., Chinn, P.Z., Harary, F.: Realization of parity visits in walking a graph. Coll. Math. J. 16, 280–282 (1985)CrossRefGoogle Scholar
  6. 6.
    Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62, 17 (2015)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Fiorini, S., Massar, S., Pokutta, S., Tiwary, H.R., de Wolf, R.: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. In: Proceedings of STOC 2012, pp. 95–106 (2012)Google Scholar
  8. 8.
    Hartvigsen, D.: Extensions of Matching Theory, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA (1984)Google Scholar
  9. 9.
    Hartvigsen, D., Li, Y.: Maximum cardinality simple 2-matchings in subcubic graphs. SIAM J. Optim. 21, 1027–1045 (2011)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Joglekar, M., Shah, N., Diwan, A.A.: Balanced group-labeled graphs. Discrete Math. 312, 1542–1549 (2012)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Springer, New York (1972)CrossRefGoogle Scholar
  12. 12.
    Kochol, M.: Polynomials associated with nowhere-zero flows. J. Comb. Theor. B 84, 260–269 (2002)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 5th edn. Springer, Heidelberg (2012)CrossRefMATHGoogle Scholar
  14. 14.
    Nishiyama, H., Kobayashi, Y., Yamauchi, Y., Kijima, S., Yamashita, M.: The parity Hamiltonian cycle problem. arXiv.org e-Print archive abs/1501.06323Google Scholar
  15. 15.
    Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)MATHGoogle Scholar
  16. 16.
    Seymour, P., Thomassen, C.: Characterization of even directed graphs. J. Comb. Theor. B 42, 36–45 (1987)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43, 441–466 (1991)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Hiroshi Nishiyama
    • 1
  • Yukiko Yamauchi
    • 1
  • Shuji Kijima
    • 1
  • Masafumi Yamashita
    • 1
  1. 1.Graduate School of Information Science and Electrical EngineeringKyushu UniversityFukuokaJapan

Personalised recommendations