Pages that link to "Item:Q3503456"
From MaRDI portal
The following pages link to Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456):
Displaying 8 items.
- Three-edge-colouring doublecross cubic graphs (Q273169) (← links)
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768) (← links)
- Edge-coloring of 3-uniform hypergraphs (Q729801) (← links)
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- Determining the total colouring number is NP-hard (Q909667) (← links)
- Complexity of approximation of 3-edge-coloring of graphs (Q975462) (← links)
- A polyhedral approach to edge coloring (Q1180838) (← links)
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs (Q2659215) (← links)