发现好书期刊，享受阅读乐趣

海量图书期刊资源，随时随地畅享阅读乐趣

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Fixed-Parameter Tractability of $$(n-k)$$ List Coloring

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 11638 (30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings) || Fixed-Parameter Tractability of $$(n-k)$$ List Coloring

Colbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia

作者Colbourn, Charles J.; Grossi, Roberto; Pisanti, Nadia
文件大小278.09KB
发表时间2019
DOI10.1007/978-3-030-25005-8_6
页码61-69

← 返回【学霸图书馆】主页