Crossref
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
Discussiones Mathematicae Graph Theory · 2020 · 40 (3) · 885
DOI: 10.7151/dmgt.2215 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discussiones Mathematicae Graph Theory, 2020. Verfasst von Krzysztof Giaro und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Giaro, K., & Kubale, M. (2020). A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4. Discussiones Mathematicae Graph Theory, 40(3), 885. https://doi.org/10.7151/dmgt.2215
Vancouver
Giaro K, Kubale M. A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4. Discussiones Mathematicae Graph Theory. 2020;40(3):885. doi:10.7151/dmgt.2215
BibTeX
@article{Giaro2020,
author = {Giaro, Krzysztof and Kubale, Marek},
title = {A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4},
journal = {Discussiones Mathematicae Graph Theory},
year = {2020},
volume = {40},
number = {3},
pages = {885},
doi = {10.7151/dmgt.2215}
}
EUVIMED