The parity Hamiltonian cycle problem

DOI10.1016/j.disc.2017.10.025zbMath1378.05117arXiv1501.06323OpenAlexW2963094534MaRDI QIDQ1690220

Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Yusuke Kobayashi, Masafumi Yamashita

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.06323

zbMATH Keywords

\(T\)-joinHamiltonian cycle problemgraph factor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• Balanced group-labeled graphs
• Expressing combinatorial optimization problems by linear programs
• Connectivity and edge-disjoint spanning trees
• Polynomials associated with nowhere-zero flows
• Exponential Lower Bounds for Polytopes in Combinatorial Optimization
• The Parity Hamiltonian Cycle Problem in Directed Graphs
• Finding 2-Factors Closer to TSP Tours in Cubic Graphs
• TSP on Cubic and Subcubic Graphs
• Maximum Cardinality Simple 2-matchings in Subcubic Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• A reduction method to find spanning Eulerian subgraphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Reducibility among Combinatorial Problems
• Linear vs. semidefinite extended formulations
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: The parity Hamiltonian cycle problem