We prove that every triangle-free graph whose subgraphs all have average degree less than 12/5 has a circular (5; 2)-coloring. This includes planar and projective-planar graphs with girth at least 12.
|Original language||English (US)|
|Number of pages||10|
|Journal||Siberian Electronic Mathematical Reports|
|State||Published - 2008|
- triangle-free graph
- projective-planar graph
- circular (k; d)-coloring