Abstract
AbstractThe 1‐chromatic number χ1(Sp) of the orientable surface Sp of genus p is the maximum chromatic number of all graphs which can be drawn on the surface so that each edge is crossed by no more than one other edge. We show that if there exists a finite field of order 4m+1, m≥3, then 8m+2≤χ1(S)≤8m+3, where 8m+3 is Ringel's upper bound on χ1(S). © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 179–184, 2010
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
