On approximating the b-chromatic number S Corteel, M Valencia-Pabon, JC Vera
Discrete Applied Mathematics 146 (1), 106-110, 2005
81 2005 On the b-Coloring of Cographs and P 4 -Sparse Graphs F Bonomo, G Durán, F Maffray, J Marenco, M Valencia-Pabon
Graphs and Combinatorics 25 (2), 153-167, 2009
79 2009 On the diameter of Kneser graphs M Valencia-Pabon, JC Vera
Discrete mathematics 305 (1-3), 383-385, 2005
68 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
30 2006 Revisiting Tucker's algorithm to color circular arc graphs M Valencia-Pabon
SIAM Journal on Computing 32 (4), 1067-1072, 2003
23 2003 Idomatic partitions of direct products of complete graphs M Valencia-Pabon
Discrete mathematics 310 (5), 1118-1122, 2010
21 2010 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 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
17 2003 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
16 2018 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
16 2015 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
14 2015 On the Minimum Sum Coloring of P 4 -Sparse Graphs F Bonomo, M Valencia-Pabon
Graphs and Combinatorics 30, 303-314, 2014
14 2014 On the LN Grippo, A Pastine, P Torres, M Valencia-Pabon, JC Vera
The Electronic Journal of Combinatorics, P3. 32-P3. 32, 2021
6 2021 On the P3-hull number of Hamming graphs B Brešar, M Valencia-Pabon
Discrete Applied Mathematics 282, 48-52, 2020
6 2020 On the (k, i)-coloring of cacti and complete graphs F Bonomo, G Duran, I Koch, M Valencia Pabon
Charles Babbage Institute, 2018
6 2018 Shifts of the stable Kneser graphs and hom-idempotence P Torres, M Valencia-Pabon
European Journal of Combinatorics 62, 50-57, 2017
6 2017 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
6 2011 Minimum sum edge colorings of multicycles J Cardinal, V Ravelomanana, M Valencia-Pabon
Discrete applied mathematics 158 (12), 1216-1223, 2010
6 2010 