On a conjecture of Erd?s, Rubin and Taylor
暂无分享,去创建一个
[1] Roland Häggkvist,et al. Some upper bounds on the total and list chromatic numbers of multigraphs , 1992, J. Graph Theory.
[2] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.
[3] N. Alon. Restricted colorings of graphs , 1993 .
[4] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[5] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory, Ser. B.
[6] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..
[7] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[8] Frédéric Maffray,et al. Kernels in perfect line-graphs , 1992, J. Comb. Theory, Ser. B.