Małafiejski, Michał; Giaro, Krzysztof; Janczewski, Robert; Kubale, Marek Sum coloring of bipartite graphs with bounded degree. (English) Zbl 1084.05029 Algorithmica 40, No. 4, 235-244 (2004). Reviewer: Van Bang Le (Rostock) MSC: 05C15 68Q25 PDFBibTeX XMLCite \textit{M. Małafiejski} et al., Algorithmica 40, No. 4, 235--244 (2004; Zbl 1084.05029) Full Text: DOI
Giaro, Krzysztof; Janczewski, Robert; Kubale, Marek; Małafiejski, Michał A 27/26-approximation algorithm for the chromatic sum coloring of bipartite graphs. (English) Zbl 1013.90129 Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2462, 135-145 (2002). MSC: 90C27 68W25 05C85 05C15 90C59 68Q17 PDFBibTeX XMLCite \textit{K. Giaro} et al., Lect. Notes Comput. Sci. 2462, 135--145 (2002; Zbl 1013.90129) Full Text: Link
Janczewski, R.; Kubale, M.; Manuszewski, K.; Piwakowski, K. The smallest hard-to-color graph for algorithm DSATUR. (English) Zbl 0999.05038 Discrete Math. 236, No. 1-3, 151-165 (2001). Reviewer: Jean Pallo (Dijon) MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{R. Janczewski} et al., Discrete Math. 236, No. 1--3, 151--165 (2001; Zbl 0999.05038) Full Text: DOI