Maximum colorful cycles in vertex-colored graphs

DOI10.1007/978-3-319-90530-3_10zbMath1484.68164OpenAlexW2797091796MaRDI QIDQ1625149

Giuseppe F. Italiano, Nguyen Kim Thang, Yannis Manoussakis, Hong Phong Pham

Publication date: 28 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Maximum colorful cycles in vertex-colored graphs