On approximating the b-chromatic number S Corteel, M Valencia-Pabon, JC Vera Discrete Applied Mathematics 146 (1), 106-110, 2005 | 74 | 2005 |

On the b-Coloring of Cographs and *P*_{4}-Sparse GraphsF Bonomo, G Duran, F Maffray, J Marenco, M Valencia-Pabon Graphs and Combinatorics 25 (2), 153-167, 2009 | 70 | 2009 |

On the diameter of Kneser graphs M Valencia-Pabon, JC Vera Discrete mathematics 305 (1-3), 383-385, 2005 | 48 | 2005 |

The packing chromatic number of hypercubes P Torres, M Valencia-Pabon Discrete Applied Mathematics 190, 127-140, 2015 | 33 | 2015 |

Independence and coloring properties of direct products of some vertex-transitive graphs M Valencia-Pabon, J Vera Discrete mathematics 306 (18), 2275-2281, 2006 | 29 | 2006 |

Revisiting Tucker's algorithm to color circular arc graphs M Valencia-Pabon SIAM Journal on Computing 32 (4), 1067-1072, 2003 | 21 | 2003 |

Idomatic partitions of direct products of complete graphs M Valencia-Pabon Discrete mathematics 310 (5), 1118-1122, 2010 | 18 | 2010 |

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid L Alcón, F Bonomo, G Durán, M Gutierrez, MP Mazzoleni, B Ries, ... Discrete Applied Mathematics 234, 12-21, 2018 | 17 | 2018 |

Minimum sum coloring of P4-sparse graphs F Bonomo, M Valencia-Pabon Electronic Notes in Discrete Mathematics 35, 293-298, 2009 | 17 | 2009 |

A distributed approximation algorithm for the minimum degree minimum weight spanning trees C Lavault, M Valencia-Pabon Journal of Parallel and Distributed Computing 68 (2), 200-208, 2008 | 17 | 2008 |

A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs F Bonomo, G Duran, A Napoli, M Valencia-Pabon Information Processing Letters 115 (6-8), 600-603, 2015 | 15 | 2015 |

The permutation-path coloring problem on trees S Corteel, M Valencia-Pabon, D Gardy, D Barth, A Denise Theoretical Computer Science 297 (1-3), 119-143, 2003 | 15 | 2003 |

Complexity of the cluster deletion problem on subclasses of chordal graphs F Bonomo, G Duran, M Valencia-Pabon Theoretical Computer Science 600, 59-69, 2015 | 13 | 2015 |

On the minimum sum coloring of p 4-sparse graphs F Bonomo, M Valencia-Pabon Graphs and Combinatorics 30 (2), 303-314, 2014 | 12 | 2014 |

Minimum sum set coloring of trees and line graphs of trees F Bonomo, G Durán, J Marenco, M Valencia-Pabon Discrete Applied Mathematics 159 (5), 288-294, 2011 | 7 | 2011 |

Minimum sum edge colorings of multicycles J Cardinal, V Ravelomanana, M Valencia-Pabon Discrete applied mathematics 158 (12), 1216-1223, 2010 | 7 | 2010 |

On the (k, i)-coloring of cacti and complete graphs F Bonomo, G Duran, I Koch, M Valencia Pabon Charles Babbage Institute, 2018 | 5 | 2018 |

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract D Barth, S Corteel, A Denise, D Gardy, M Valencia-Pabon Latin American Symposium on Theoretical Informatics, 308-317, 2000 | 5 | 2000 |

Independence number of products of Kneser graphs B Brešar, M Valencia-Pabon Discrete Mathematics 342 (4), 1017-1027, 2019 | 4 | 2019 |

Shifts of the stable Kneser graphs and hom-idempotence P Torres, M Valencia-Pabon European Journal of Combinatorics 62, 50-57, 2017 | 3 | 2017 |