Author:
Alon Noga,Mohar Bojan,Sanders Daniel P.
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. M. O. Albertson and D. M. Berman,The acyclic chromatic number, Congressus Numerantium17 (1976), 51–60.
2. M. O. Albertson and D. M. Berman,Every planar graph has an acyclic 7-coloring, Israel Journal of Mathematics28 (1977), 169–174.
3. M. O. Albertson and D. M. Berman,An acyclic analogue to Heawood's theorem, Glasgow Mathematical Journal19 (1978), 163–166.
4. N. Alon, C. McDiarmid and B. Reed,Acyclic colouring of graphs, Random Structures and Algorithms2 (1991), 277–288.
5. N. Alon and J. H. Spencer,The Probabilistic Method, Wiley, 1992.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hardness transitions and uniqueness of acyclic colouring;Discrete Applied Mathematics;2024-03
2. On b-acyclic chromatic number of a graph;Computational and Applied Mathematics;2022-12-26
3. Coloring Graphs Without Bichromatic Cycles or Paths;Bulletin of the Malaysian Mathematical Sciences Society;2020-10-24
4. Planar Graphs Have Bounded Queue-Number;Journal of the ACM;2020-08-13
5. Planar Graphs have Bounded Queue-Number;2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS);2019-11