2026-07-21T23:33:50Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:21152 2024-09-23T09:13:18Z ddc:004 open_access

Edge-Coloring Sparse Graphs with Δ Colors in Quasilinear Time Kowalik, Łukasz edge coloring algorithm sparse graph quasilinear In this paper we show that every graph G of bounded maximum average degree mad(G) and with maximum degree Δ can be edge-colored using the optimal number of Δ colors in quasilinear time, whenever Δ ≥ 2mad(G). The maximum average degree is within a multiplicative constant of other popular graph sparsity parameters like arboricity, degeneracy or maximum density. Our algorithm extends previous results of Chrobak and Nishizeki [Marek Chrobak and Takao Nishizeki, 1990] and Bhattacharya, Costa, Panski and Solomon [Sayan Bhattacharya et al., 2023]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Łukasz Kowalik 2024 Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2024.81 urn:nbn:de:0030-drops-211523 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.81 eng https://creativecommons.org/licenses/by/4.0/legalcode