Pages that link to "Item:Q975462"

The following pages link to Complexity of approximation of 3-edge-coloring of graphs (Q975462):

Displaying 3 items.

• On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
• Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
• Three measures of edge-uncolorability (Q616368) (← links)