Pages that link to "Item:Q2479530"
From MaRDI portal
The following pages link to New linear-time algorithms for edge-coloring planar graphs (Q2479530):
Displaying 10 items.
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- 4-edge-coloring graphs of maximum degree 3 in linear time (Q1603501) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- A planar linear arboricity conjecture (Q2891050) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- A Linear Algorithm for Colouring Planar Graphs with Five Colours (Q3219789) (← links)
- Improved edge-coloring algorithms for planar graphs (Q3495664) (← links)