暂无分享,去创建一个
Mickaël Montassier | Alexandre Pinlou | Daniel Gonçalves | Mickaël Montassier | D. Gonçalves | Alexandre Pinlou | M. Montassier
[1] Hervé Hocquard,et al. Acyclic coloring of graphs with maximum degree five , 2010 .
[2] Alexandr V. Kostochka,et al. Graphs with maximum degree 5 are acyclically 7-colorable , 2011, Ars Math. Contemp..
[3] Jakub Przybylo,et al. On the Facial Thue Choice Index via Entropy Compression , 2012, J. Graph Theory.
[4] Bruce A. Reed,et al. A Bound on the Total Chromatic Number , 1998, Comb..
[5] Jakub Przybylo,et al. On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method , 2013, Graphs Comb..
[6] Glenn G. Chappell,et al. Coloring with no 2-Colored P4's , 2004, Electron. J. Comb..
[7] Jaroslaw Grytczuk,et al. Nonrepetitive Colorings of Graphs - A Survey , 2007, Int. J. Math. Math. Sci..
[8] Aline Parreau,et al. Acyclic edge-coloring using entropy compression , 2012, Eur. J. Comb..
[9] Kishore Kothapalli,et al. Acyclic Vertex Coloring of Graphs of Maximum Degree Six , 2009, Electron. Notes Discret. Math..
[10] Bruce A. Reed,et al. Acyclic Coloring of Graphs , 1991, Random Struct. Algorithms.
[11] Anna Fiedorowicz,et al. Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree , 2013, Discuss. Math. Graph Theory.
[12] Noga Alon,et al. Acyclic edge colorings of graphs , 2001, J. Graph Theory.
[13] H. Robbins. A Remark on Stirling’s Formula , 1955 .
[14] David R. Wood,et al. Nonrepetitive colouring via entropy compression , 2011, Comb..
[15] Bruce A. Reed,et al. A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.
[16] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[17] André Raspaud,et al. Acyclic coloring of graphs of maximum degree five: Nine colors are enough , 2008, Inf. Process. Lett..
[18] N. S. Barnett,et al. Private communication , 1969 .
[19] C. R. Subramanian,et al. Bounds on vertex colorings with restrictions on the union of color classes , 2010, J. Graph Theory.
[20] Július Czap,et al. Facial Nonrepetitive Vertex Coloring of Plane Graphs , 2013, J. Graph Theory.
[21] Hamed Hatami,et al. Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number , 2005, J. Comb. Theory, Ser. B.
[22] Kishore Kothapalli,et al. Acyclic vertex coloring of graphs of maximum degree 5 , 2011, Discret. Math..
[23] Noga Alon,et al. Nonrepetitive colorings of graphs , 2002, Random Struct. Algorithms.
[24] Nicholas C. Wormald,et al. The generalized acyclic edge chromatic number of random regular graphs , 2006, J. Graph Theory.
[25] Catherine S. Greenhill,et al. Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs , 2005, Graphs Comb..
[26] Noga Alon,et al. Acyclic edge colorings of graphs , 2001 .
[27] Jens Schreyer,et al. On the facial Thue choice index of plane graphs , 2012, Discret. Math..
[28] Bruce A. Reed,et al. Star coloring of graphs , 2004, J. Graph Theory.
[29] Yancai Zhao,et al. Acyclic vertex coloring of graphs of maximum degree six , 2014, Discret. Math..
[30] Bruce A. Reed,et al. List Colouring Squares of Planar Graphs , 2007, Electron. Notes Discret. Math..
[31] John W. Moon,et al. On an asymptotic method in enumeration , 1989, J. Comb. Theory, Ser. A.
[32] Vera T. Sós,et al. Infinite and finite sets : to Paul Erdős on his 60th birthday , 1975 .
[33] Jan Volec,et al. A note on acyclic vertex-colorings , 2013, 1312.5600.
[34] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[35] Aldo Procacci,et al. Improved bounds on coloring of graphs , 2010, Eur. J. Comb..
[36] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[37] C. R. Subramanian,et al. Forbidden subgraph colorings and the oriented chromatic number , 2009, Eur. J. Comb..
[38] M. Albertson,et al. Every planar graph has an acyclic 7-coloring , 1977 .
[39] Wayne Goddard,et al. Acyclic colorings of planar graphs , 1991, Discret. Math..