Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference23 articles.
1. Bang-Jensen, J., Bellitto, T., Schweser, T., Stiebitz, M.: A Hajós-like theorem for digraphs. submitted to Electronic J. Combin. arXiv:1908.04096v1 [math.CO] (2019)
2. Bokal, D., Fijavž, G., Juvan, M., Kayll, P.M., Mohar, B.: The circular chromatic number of a digraph. J. Gr. Theory 46, 227–240 (2004)
3. Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philos. Soc. Math. Phys. Sci. 37, 194–197 (1941)
4. Dirac, G.A.: A property of 4-chromatic graphs and some remarks on critical graphs. J. Lond. Math. Soc. 27, 85–92 (1952)
5. Dirac, G.A.: The structure of $$k$$-chromatic graphs. Fund. Math. 40, 42–55 (1953)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献