Pages that link to "Item:Q602768"
From MaRDI portal
The following pages link to Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface (Q602768):
Displaying 5 items.
- Complexity of approximation of 3-edge-coloring of graphs (Q975462) (← links)
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs (Q2659215) (← links)
- Approximation of 3-Edge-Coloring of Cubic Graphs (Q3503456) (← links)
- Existence of polyhedral embeddings of graphs (Q5955209) (← links)
- Online Edge Coloring via Tree Recurrences and Correlation Decay (Q6203478) (← links)