Approximating the Maximum 3- and 4-Edge-Colorable Subgraph

Lecture Notes in Computer Science - Algorithm Theory - SWAT 2010 ◽

10.1007/978-3-642-13731-0_37 ◽

2010 ◽

pp. 395-407 ◽

Cited By ~ 1

Author(s):

Marcin Kamiński ◽

Łukasz Kowalik

Download Full-text