The Parity Hamiltonian Cycle Problem in Directed Graphs

DOI10.1007/978-3-319-45587-7_5zbMath1432.05060OpenAlexW2511436023MaRDI QIDQ2835661

Shuji Kijima, Yukiko Yamauchi, Hiroshi Nishiyama, Masafumi Yamashita

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_5

zbMATH Keywords

Hamiltonian cycle\(T\)-joinslinear system over GF(2)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The parity Hamiltonian cycle problem

Cites Work

• Balanced group-labeled graphs
• Characterization of even directed graphs
• Expressing combinatorial optimization problems by linear programs
• Polynomials associated with nowhere-zero flows
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• Finding 2-Factors Closer to TSP Tours in Cubic Graphs
• TSP on Cubic and Subcubic Graphs
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• Linear vs. semidefinite extended formulations
• Combinatorial optimization. Theory and algorithms.
• Unnamed Item
• Unnamed Item

This page was built for publication: The Parity Hamiltonian Cycle Problem in Directed Graphs