Edge-coloring algorithms for bounded degree multigraphs

DOI10.1137/1.9781611977912.77MaRDI QIDQ6645436zbMATH OpenFDO

Authors Abhishek Dhawan

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.77

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• Fast algorithms for Vizing's theorem on bounded degree graphs
• Fast and simple (1 + ) -edge-coloring of dense graphs
• Multigraph edge-coloring with local list sizes
• A linear-time algorithm for (1+)-edge-coloring
• Vizing's theorem in near-linear time

This page was built for publication: Edge-coloring algorithms for bounded degree multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645436)