A sufficient condition for planar graphs to be (3, 1)-choosable
暂无分享,去创建一个
Min Chen | Wei-Fan Wang | Yiqiao Wang | Yingying Fan | Weifan Wang | Yiqiao Wang | Min Chen | Yingying Fan
[1] Zoltán Füredi,et al. Choosability with Separation of Complete Multipartite Graphs and Hypergraphs , 2011, Journal of Graph Theory.
[2] Margit Voigt. List colourings of planar graphs , 2006, Discret. Math..
[3] Ko-Wei Lih,et al. On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles , 2018 .
[4] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.
[5] Riste Skrekovski. A note on choosability with separation for planar graphs , 2001, Ars Comb..
[6] Zsolt Tuza,et al. Brooks-type theorems for choosability with separation , 1998, J. Graph Theory.
[7] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[8] Derrick Stolee,et al. On Choosability with Separation of Planar Graphs with Forbidden Cycles , 2013, J. Graph Theory.
[9] Mohit Kumbhat,et al. Choosability with separation of complete graphs and minimal abundant packings , 2013 .