A note on equitable Hamiltonian cycles

Given a complete graph with an even number of vertices, and with each edge colored with one of two colors (say red or blue), an equitable Hamiltonian cycle is a Hamiltonian cycle that can be decomposed into two perfect matchings such that both perfect matchings have the same number of red edges. We...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2021-11, Vol.303, p.127-136
Hauptverfasser:	Ophelders, Tim, Lambers, Roel, Spieksma, Frits C.R., Vredeveld, Tjark
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Colored complete graphs Equitable Hamiltonian cycle Graph coloring Graph theory Graphs Local search Polynomial time algorithm
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!