The parity Hamiltonian cycle problem

@article{Nishiyama2018ThePH,
  title={The parity Hamiltonian cycle problem},
  author={H. Nishiyama and Y. Kobayashi and Y. Yamauchi and Shuji Kijima and M. Yamashita},
  journal={Discret. Math.},
  year={2018},
  volume={341},
  pages={606-626}
}
  • H. Nishiyama, Y. Kobayashi, +2 authors M. Yamashita
  • Published 2018
  • Mathematics, Computer Science
  • Discret. Math.
  • Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs, and give a linear time algorithm to find a PHC, in which every edge appears at most four times, in fact. In contrast, we show that finding a… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

    SHOWING 1-10 OF 44 REFERENCES
    Maximum Cardinality Simple 2-matchings in Subcubic Graphs
    • 14
    TSP on Cubic and Subcubic Graphs
    • 38
    • PDF
    Finding 2-Factors Closer to TSP Tours in Cubic Graphs
    • 35
    • PDF
    A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
    • 121
    The number of nowhere-zero flows on graphs and signed graphs
    • 41
    • PDF
    Balanced group-labeled graphs
    • 10
    • PDF
    A reduction method to find spanning Eulerian subgraphs
    • P. Catlin
    • Mathematics, Computer Science
    • J. Graph Theory
    • 1988
    • 213
    The Planar Hamiltonian Circuit Problem is NP-Complete
    • 490
    K-walks of Graphs
    • 75
    • PDF