Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
From MaRDI portal
Publication:830935
DOI10.1007/s10878-020-00644-7zbMath1462.05140MaRDI QIDQ830935
Sheng Gui Zhang, Hajo J. Broersma, Ruonan Li, Zhi-Wei Guo
Publication date: 10 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00644-7
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs