Abstract
Abstract For a simple graph of maximum degree Δ, the complexity of computing the fractional total chromatic number is unknown. Trivially it is at least Δ + 1 . Kilakos and Reed proved that it is at most Δ + 2 . In this paper, we strengthen this by characterizing exactly those simple graphs with fractional total chromatic number Δ + 2 . This yields a simple linear-time algorithm to determine whether a given graph has fractional chromatic number Δ + 2 .
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
