Pages that link to "Item:Q975462"
From MaRDI portal
The following pages link to Complexity of approximation of 3-edge-coloring of graphs (Q975462):
Displaying 7 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)
- Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. (Q2768314) (← links)
- Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs (Q2927657) (← links)
- Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)