An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths
Crossref DOI link: https://doi.org/10.1007/s00453-016-0130-2
Published Online: 2016-02-09
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Micek, Piotr
Wiechert, Veit
Funding for this research was provided by:
Polish National Science Center (PL) (UMO-2011/03/D/ST6/01370)
Deutsche Forschungsgemeinschaft (DE) (GRK 1408)
License valid from 2016-02-09