Precoloring Extension. IV. General Bounds and List Colorings
From MaRDI portal
(Redirected from Publication:6364404)
Abstract: A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
This page was built for publication: Precoloring Extension. IV. General Bounds and List Colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6364404)
