1 |
M. Molloy and B. Reed, Further algorithmic aspects of the local lemma, In: it Proceedings of the 30th Annual ACM Symposium on Theory of Computing (1998), pp. 524-529.
|
2 |
S. Ndreca, A. Procacci, and B. Scoppola, Improved bounds on coloring of graphs, available online at http://arxiv.org/pdf/1005.1875v1.
|
3 |
G. Ringel, Ein sechsfarbenproblem auf der Kugel, Abh. Math. Sem. Univ. Hamburg 29 (1965), 107-117.
DOI
|
4 |
N. Alon, C. J. H. McDiarmid, and B. A. Reed, Acyclic coloring of graphs, Random Structures Algorithms 2 (1991), no. 3, 277-288.
DOI
ScienceOn
|
5 |
N. Alon, B. Sudakov, and A. Zaks, Acyclic edge-colorings of graphs, J. Graph Theory 37 (2001), no. 3, 157-167.
DOI
ScienceOn
|
6 |
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.
|
7 |
T. F. Coleman and J. Cai, The cyclic coloring problem and estimation of sparse Hessian matrices, SIAM J. Algebraic Discrete Methods 7 (1986), no. 2, 221-235.
DOI
|
8 |
T. F. Coleman and J. J. More, Estimation of sparse Hessian matrices and graph coloring problems, Math. Programming 28 (1984), no. 3, 243-270.
DOI
|
9 |
A. Fiedorowicz, M. Halszczak, and N. Narayanan, About acyclic edge colourings of planar graphs, Inform. Process. Lett. 108 (2008), no. 6 412-417.
DOI
ScienceOn
|
10 |
I. Fabrici and T. Madaras, The structure of 1-planar graphs, Discrete Math. 307 (2007), no. 7-8, 854-865.
DOI
ScienceOn
|
11 |
B. Grunbaum, Acyclic colorings of planar graphs, Israel J. Math. 14 (1973), 390-408.
DOI
|