H.L. Abbott, M. Katchalski, and B. Zhou, Proof of a conjecture of Dirac concerning 4-critical planar graphs, Discrete Math. 132, 367-371, 1994.
August 28, 1997. Tommy R. Jensen
O.V. Borodin, A new proof of the 6 color theorem, J. Graph Theory 19, 507-521, 1995.
August 12, 1997. Tommy R. Jensen
O.V. Borodin, Cyclic degree and cyclic coloring of 3-polytopes, J. Graph Theory 23, 225-231, 1996.
August 12, 1997. Tommy R. Jensen
O.V. Borodin, Structural theorem on plane graphs with application to the entire coloring number, J. Graph Theory 23, 233-239, 1996.
August 12, 1997. Tommy R. Jensen
O.V. Borodin, Structural properties of plane graphs without adjacent triangles and an application to 3-colorings, J. Graph Theory 21, 183-186, 1996.
August 12, 1997. Tommy R. Jensen
M.N. Ellingham and L. Goddyn, List edge colourings of some 1-factorable multigraphs, Combinatorica 16, 343-352, 1996.
August 7, 1997. Tommy R. Jensen
S. Gutner, The complexity of planar graph choosability, Discrete Math. 159, 119-130, 1996.
August 22, 1997. Tommy R. Jensen
J. Kratochvíl and Zs. Tuza, Algorithmic complexity of list colorings, Discrete Appl. Math. 50, 297-302, 1994.
August 25, 1997. Tommy R. Jensen
D.P. Sanders and Y. Zhao, A note on the three color problem, Graphs Combin. 11, 91-94, 1995.
August 27, 1997. Tommy R. Jensen
C. Thomassen, Decomposing a Planar Graph into Degenerate Graphs, J. Combin. Theory Ser. B 65, 305-314, 1995.
August 29, 1997. Tommy R. Jensen
M. Voigt, A not 3-choosable planar graph without 3-cycles, Discrete Math. 146, 325-328, 1995.
August 27, 1997. Tommy R. Jensen