Premium
4‐chromatic projective graphs
Author(s) -
Youngs D. A.
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199602)21:2<219::aid-jgt12>3.0.co;2-e
Subject(s) - combinatorics , mathematics , chromatic scale , projective test , discrete mathematics , edge coloring , critical graph , graph , line graph , graph power , pure mathematics
We construct a family of 4‐chromatic graphs which embed on the projective plane, and characterize the edge‐critical members. The family includes 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 circuit in a 4‐chromatic graph. © 1996 John Wiley & Sons, Inc.