Bordeaux 3-color conjecture and 3-choosability
暂无分享,去创建一个
[1] Ko-Wei Lih,et al. Choosability and edge choosability of planar graphs without five cycles , 2002, Appl. Math. Lett..
[2] Li Zhang,et al. A note on 3-choosability of planar graphs without certain cycles , 2005, Discret. Math..
[3] Shai Gutner. The complexity of planar graph choosability , 1996, Discret. Math..
[4] Ivan M. Havel,et al. On a conjecture of B. Grünbaum , 1969 .
[5] Baogang Xu,et al. The 4-Choosability of Plane Graphs without 4-Cycles' , 1999, J. Comb. Theory, Ser. B.
[6] Peter Che Bor Lam,et al. The 3-choosability of plane graphs of girth 4 , 2005, Discret. Math..
[7] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.
[8] Margit Voigt,et al. List colourings of planar graphs , 2006, Discret. Math..
[9] Ko-Wei Lih,et al. Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles , 2002, SIAM J. Discret. Math..
[10] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[11] Baogang Xu,et al. On Structure of Some Plane Graphs with Application to Choosability , 2001, J. Comb. Theory B.
[12] Carsten Thomassen,et al. 3-List-Coloring Planar Graphs of Girth 5 , 1995, J. Comb. Theory, Ser. B.
[13] Margit Voigt. A non-3-choosable planar graph without cycles of length 4 and 5 , 2007, Discret. Math..
[14] André Raspaud,et al. A sufficient condition for planar graphs to be 3-colorable , 2003, J. Comb. Theory, Ser. B.
[15] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[16] Stanislav Jendrol',et al. On a conjecture by B. Grünbaum , 1972, Discret. Math..