共 50 条
- [23] Path coloring problems in graphs are non-approximable ADVANCES IN INFORMATICS, 2000, : 223 - 230
- [27] Fractional Path Coloring in Bounded Degree Trees with Applications Algorithmica, 2010, 58 : 516 - 540
- [28] Acyclic coloring of graphs without bichromatic long path Frontiers of Mathematics in China, 2015, 10 : 1343 - 1354