Pages that link to "Item:Q1603501"
From MaRDI portal
The following pages link to 4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501):
Displaying 5 items.
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- New linear-time algorithms for edge-coloring planar graphs (Q2479530) (← links)
- The 3-Colorability Problem on Graphs with Maximum Degree Four (Q4429678) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- (Q6075938) (← links)