The mod k $k$ chromatic index of graphs is O(k) $O(k)$

DOI10.1002/jgt.22866zbMath1522.05096arXiv2007.08324OpenAlexW4288758394MaRDI QIDQ6093146

Yoshiharu Kohayakawa, Lucas Colucci, Fábio Botler

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

edge coloringsmodulo \(k\) colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The mod k $k$ chromatic index of random graphs

Cites Work

• Unnamed Item
• Graph factors modulo \(k\)
• Regular subgraphs of almost regular graphs
• On graph decompositions modulo \(k\)
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

This page was built for publication: The mod k $k$ chromatic index of graphs is O(k) $O(k)$