The complexity of planar graph choosability
暂无分享,去创建一个
[1] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..
[2] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..
[3] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..
[4] Carsten Thomassen,et al. 3-List-Coloring Planar Graphs of Girth 5 , 1995, J. Comb. Theory B.
[5] Zsolt Tuza,et al. Algorithmic complexity of list colorings , 1994, Discret. Appl. Math..
[6] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.
[7] Margit Voigt,et al. List colourings of planar graphs , 2006, Discret. Math..
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..