Author:
Kang Ross J.,Müller Tobias
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. Acyclic t-improper colourings of graphs with bounded maximum degree;Addario-Berry;Discrete Math.,2010
2. L. Addario-Berry, R.J. Kang, T. Müller, Acyclic dominating partitions, J. Graph Theory, 2010, in press (doi:10.1002/jgt.20457).
3. The acyclic chromatic number;Albertson,1976
4. Acyclic coloring of graphs;Alon;Random Structures Algorithms,1991
5. The chromatic number of graph powers;Alon;Combin. Probab. Comput.,2002
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DMCSC: a fully distributed multi-coloring approach for scalable communication in synchronous broadcast networks;The Journal of Supercomputing;2022-07-19
2. The complexity of frugal colouring;Arabian Journal of Mathematics;2021-01-29
3. Separation dimension and degree;Mathematical Proceedings of the Cambridge Philosophical Society;2019-11-22
4. Vertex Coloring with Communication Constraints in Synchronous Broadcast Networks;IEEE Transactions on Parallel and Distributed Systems;2019-07-01
5. On Coloring Problems;Handbook of Combinatorial Optimization;2013