Acyclic 5-choosability of planar graphs without 4-cycles
暂无分享,去创建一个
[1] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .
[2] Oleg V. Borodin,et al. Acyclic 5-choosability of planar graphs without adjacent short cycles , 2011, J. Graph Theory.
[3] André Raspaud,et al. On fans in multigraphs , 2006 .
[4] Hervé Hocquard,et al. Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable , 2009, Inf. Process. Lett..
[5] André Raspaud,et al. Acyclic list 7‐coloring of planar graphs , 2002, J. Graph Theory.
[6] Min Chen,et al. On acyclic 4-choosability of planar graphs without short cycles , 2010, Discret. Math..
[7] Min Chen,et al. Acyclic 5-choosability of planar graphs without 4-cycles , 2008, Discret. Math..
[8] André Raspaud,et al. Acyclic 4-Choosability of Planar Graphs Without Cycles of Specific Lengths , 2006 .
[9] Oleg V. Borodin,et al. On acyclic colorings of planar graphs , 2006, Discret. Math..
[10] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.
[11] Oleg V. Borodin,et al. Acyclic 4-Choosability of Planar Graphs with No 4- and 5-Cycles , 2013, J. Graph Theory.
[12] Mickaël Montassier. Acyclic 4-choosability of Planar Graphs with Girth at Least 5 , 2006 .
[13] André Raspaud,et al. Acyclic 5-choosability of planar graphs without small cycles , 2007 .
[14] Min Chen,et al. Planar graphs without 4-cycles are acyclically 6-choosable , 2009 .
[15] J. Mitchem. Every planar graph has an acyclic $8$-coloring , 1974 .
[16] Min Chen,et al. A sufficient condition for planar graphs to be acyclically 5-choosable , 2012, J. Graph Theory.
[17] André Raspaud,et al. Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles , 2010, Discret. Math..
[18] D. R. Woodall,et al. Acyclic Colourings of Planar Graphs with Large Girth , 1999 .
[19] B. Grünbaum. Acyclic colorings of planar graphs , 1973 .
[20] Min Chen,et al. Acyclic 3-choosability of sparse graphs with girth at least 7 , 2010, Discret. Math..
[21] Alexandr V. Kostochka,et al. Note to the paper of Grünbaum on acyclic colorings , 1976, Discret. Math..
[22] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.
[23] M. Albertson,et al. Every planar graph has an acyclic 7-coloring , 1977 .
[24] A. V. Kostov cka. Acyclic $6$-coloring of planar graphs , 1976 .