A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs

From MaRDI portal

(Redirected from A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs)

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=A_polynomial-time_nearly-optimal_algorithm_for_an_edge_coloring_problem_in_outerplanar_graphs&oldid=60722316"