We construct a family of 4-chromatic graphs which embed on the project
ive plane, and characterize the edge-critical members. The family incl
udes many well known graphs, and also a new sequence of graphs, which
serve to improve Gallai's bound on the length of the shortest odd circ
uit in a 4-chromatic graph. (C) 1996 John Wiley & Sons, Inc.