1. On Graphs that do not Contain a Thomsen Graph
2. , and , List-coloring squares of sparse subcubic graphs, submitted for publication.
3. , , and , Coloring squares of planar graphs with no short cycles, submitted for publication.
4. , and , Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, 1979, Congressus Numeratium, 26 ( 1980), 125–157.