The rainbow cycle cover problem

DOI10.1002/NET.21700zbMATH Open1386.05068OpenAlexW2514737704MaRDI QIDQ4642402FDOQ4642402

Authors: Selene Silvestri, G. Laporte, Raffaele Cerulli 

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21700

Recommendations

• On the complexity of \(k\)-rainbow cycle colouring problems
• The rainbow spanning forest problem
• The rainbow connection problem: mathematical formulations.
• On minimum reload cost cycle cover
• On minimum reload cost cycle cover

zbMATH Keywords

branch-and-cutedge-colored graphrainbow cyclesrainbow cycle cover problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cited In (5)

• Rainbow Turán problem for even cycles
• On the complexity of rainbow spanning forest problem
• The rainbow spanning forest problem
• The rainbow Steiner tree problem
• Two heuristics for the rainbow spanning forest problem

This page was built for publication: The rainbow cycle cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642402)