Maximum colorful cliques in vertex-colored graphs
From MaRDI portal
Publication:1791008
DOI10.1007/978-3-319-94776-1_40OpenAlexW2811144945MaRDI QIDQ1791008
Hong Phong Pham, Yannis Manoussakis, Giuseppe F. Italiano, Nguyen Kim Thang
Publication date: 4 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-94776-1_40
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
This page was built for publication: Maximum colorful cliques in vertex-colored graphs
