List edge multicoloring in graphs with few cycles

DOI10.1016/J.IPL.2003.09.016zbMath1183.68433OpenAlexW2148239618MaRDI QIDQ1029053

Dániel Marx

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.09.016

zbMATH Keywords

edge coloringgraph algorithmsmulticoloringlist coloring

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Walking through waypoints ⋮ Subgraph isomorphism on graph classes that exclude a substructure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of completing partial Latin squares
• Matching theory
• Matching is as easy as matrix inversion
• Extending an edge-coloring
• Graph colorings with local constraints -- a survey
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: List edge multicoloring in graphs with few cycles