Author:
Nešetřil Jarik,Raspaud André,Sopena Eric
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference19 articles.
1. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
2. The effect of two cycles on the complexity of colourings by directed graphs;Bang-Jensen;Discrete Appl. Math.,1990
3. The complexity of colorings by semicomplete digraphs;Bang-Jensen;SIAM J. Discrete Math.,1988
4. On acyclic coloring of planar graphs;Borodin;Discrete Math.,1979
5. O.V. Borodin, A.V. Kostochka and D.R. Woodall, unpublished manuscript, 1995.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献