Document is current

Any future updates will be listed below

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

Crossref DOI link: https://doi.org/10.1007/s10898-015-0360-x

Published Online: 2015-10-05

Published Print: 2016-06

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark