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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have