Sum coloring and interval graphs: A tight upper bound for the minimum number of colors

From MaRDI portal

(Redirected from Sum coloring and interval graphs: A tight upper bound for the minimum number of colors)

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Sum_coloring_and_interval_graphs:_A_tight_upper_bound_for_the_minimum_number_of_colors&oldid=71382078"