A note on connected greedy edge colouring

DOI10.1016/j.dam.2021.07.018zbMath1473.05082arXiv2012.13916OpenAlexW3189633232MaRDI QIDQ2231754

Marthe Bonamy, Alexandra Wesolek, Carole Muller, Jonathan Narboni, Carla Groenland, Jakub Pekárek

Publication date: 30 September 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.13916

zbMATH Keywords

computational complexityedge colouringgreedy colouringconnected greedy colouringconnected greedy edge colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Connected greedy coloring of \(H\)-free graphs
• Results on the Grundy chromatic number of graphs
• Complexity of Grundy coloring and its variants
• NP completeness of finding the chromatic index of regular graphs
• Connected Greedy Colourings

This page was built for publication: A note on connected greedy edge colouring