Abstract
We study three invariants of graphs measuring how far a graph is from having a proper 3-edge-coloring. We show that they have the same value on certain classes of graphs, in particular on the class of cubic graphs.
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
