Complexity of approximation of 3-edge-coloring of graphs
From MaRDI portal
Publication:975462
DOI10.1016/j.ipl.2008.05.015zbMath1191.68468MaRDI QIDQ975462
Katarína Šranková, Nad'a Krivoňáková, Silvia Smejová, Martin Kochol
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.015
Related Items
On the complexity of deciding whether the regular number is at most two, Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface, Three measures of edge-uncolorability
Cites Work