A note on equitable Hamiltonian cycles

DOI10.1016/j.dam.2020.08.023zbMath1472.05090OpenAlexW3082258222WikidataQ114191503 ScholiaQ114191503MaRDI QIDQ1983122

Frits C. R. Spieksma, Tim Ophelders, Roel Lambers, Tjark Vredeveld

Publication date: 15 September 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.08.023

zbMATH Keywords

local searchpolynomial time algorithmcolored complete graphsequitable Hamiltonian cycle

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes
• Matching graphs of hypercubes and complete bipartite graphs
• Alternating cycles and paths in edge-coloured multigraphs: A survey
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes
• Exact algorithms for the equitable traveling salesman problem
• A new sufficient condition for the existence of alternating Hamiltonian cycles in 2-edge-colored multigraphs
• Perfect matchings extend to Hamilton cycles in hypercubes
• Cycles and paths in edge‐colored graphs with given degrees
• Recent developments in graph Ramsey theory
• Fast Hamiltonicity Checking Via Bases of Perfect Matchings
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on equitable Hamiltonian cycles