Choosability with separation of planar graphs without prescribed cycles
暂无分享,去创建一个
André Raspaud | Wei-Fan Wang | Wai Chee Shiu | Min Chen | Yingying Fan | W. Shiu | A. Raspaud | Weifan Wang | Min Chen | Yingying Fan
[1] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.
[2] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[3] Derrick Stolee,et al. On Choosability with Separation of Planar Graphs with Forbidden Cycles , 2013, J. Graph Theory.
[4] Jan Kratochvíl,et al. Brooks-type theorems for choosability with separation , 1998 .
[5] Riste Skrekovski. A note on choosability with separation for planar graphs , 2001, Ars Comb..
[6] Margit Voigt. List colourings of planar graphs , 2006, Discret. Math..
[7] Zoltán Füredi,et al. Choosability with Separation of Complete Multipartite Graphs and Hypergraphs , 2011, Journal of Graph Theory.
[8] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[9] Ko-Wei Lih,et al. On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles , 2018 .
[10] Min Chen,et al. A sufficient condition for planar graphs to be (3, 1)-choosable , 2017, Journal of Combinatorial Optimization.