Mario Valencia-Pabon

According to our database, Mario Valencia-Pabon authored at least 42 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the total chromatic number of the direct product of cycles and complete graphs.

Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon

RAIRO Oper. Res., 2024

The rotation distance of brooms.

Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon

Eur. J. Comb., 2024

On the diameter of Schrijver graphs.

Agustina Victoria Ledezma, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon

Discret. Appl. Math., 2024

2022

On total and edge coloring some Kneser graphs.

Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon

J. Comb. Optim., 2022

On restricted completions of chordal and trivially perfect graphs.

Mitre Costa Dourado, Luciano N. Grippo, Mario Valencia-Pabon

CoRR, 2022

2021

On the $P_3$-Hull Number of Kneser Graphs.

Luciano N. Grippo, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon, Juan C. Vera

Electron. J. Comb., 2021

On the diameter of Schrijver graphs.

Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

On total coloring the direct product of complete graphs.

Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Bounds on the Diameter of Graph Associahedra.

Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

On the P3-hull number of Hamming graphs.

Bostjan Bresar, Mario Valencia-Pabon

Discret. Appl. Math., 2020

Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017.

Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon

Discret. Appl. Math., 2020

A note on homomorphisms of Kneser hypergraphs.

Flavia Bonomo-Braberman, Mitre Costa Dourado, Mario Valencia-Pabon, Juan C. Vera

Appl. Math. Comput., 2020

2019

Independence number of products of Kneser graphs.

Bostjan Bresar, Mario Valencia-Pabon

Discret. Math., 2019

2018

k-tuple colorings of the Cartesian product of graphs.

Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon

Discret. Appl. Math., 2018

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.

Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon

Discret. Appl. Math., 2018

On the (k, i)-coloring of cacti and complete graphs.

Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon

Ars Comb., 2018

2017

LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.

Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera

Electron. Notes Discret. Math., 2017

Shifts of the stable Kneser graphs and hom-idempotence.

Pablo Daniel Torres, Mario Valencia-Pabon

Eur. J. Comb., 2017

2015

Complexity of the cluster deletion problem on subclasses of chordal graphs.

Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon

Theor. Comput. Sci., 2015

A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs.

Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon

Inf. Process. Lett., 2015

k-tuple chromatic number of the cartesian product of graphs.

Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon

Electron. Notes Discret. Math., 2015

The packing chromatic number of hypercubes.

Pablo Daniel Torres, Mario Valencia-Pabon

Discret. Appl. Math., 2015

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs.

Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon

Algorithmica, 2015

2014

On the Minimum Sum Coloring of P 4-Sparse Graphs.

Flavia Bonomo, Mario Valencia-Pabon

Graphs Comb., 2014

LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011.

Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon

Discret. Appl. Math., 2014

2011

On lower bounds for the b-chromatic number of connected bipartite graphs.

Mekkia Kouider, Mario Valencia-Pabon

Electron. Notes Discret. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.

Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon

Electron. Notes Discret. Math., 2011

Minimum sum set coloring of trees and line graphs of trees.

Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon

Discret. Appl. Math., 2011

2010

Idomatic partitions of direct products of complete graphs.

Mario Valencia-Pabon

Discret. Math., 2010

Minimum sum edge colorings of multicycles.

Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon

Discret. Appl. Math., 2010

2009

On the b-Coloring of Cographs and <i>P</i>₄-Sparse Graphs.

Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon

Graphs Comb., 2009

Minimum Sum Coloring of P₄-sparse graphs.

Flavia Bonomo, Mario Valencia-Pabon

Electron. Notes Discret. Math., 2009

Minimum Sum Set Coloring on some Subclasses of Block Graphs.

Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

A distributed approximation algorithm for the minimum degree minimum weight spanning trees.

Christian Lavault, Mario Valencia-Pabon

J. Parallel Distributed Comput., 2008

Chromatic Edge Strength of Some Multigraphs.

Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon

Electron. Notes Discret. Math., 2008

2006

Independence and coloring properties of direct products of some vertex-transitive graphs.

Mario Valencia-Pabon, Juan Vera

Discret. Math., 2006

2005

On the diameter of Kneser graphs.

Mario Valencia-Pabon, Juan-Carlos Vera

Discret. Math., 2005

On approximating the b-chromatic number.

Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera

Discret. Appl. Math., 2005

2003

The permutation-path coloring problem on trees.

Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise

Theor. Comput. Sci., 2003

Revisiting Tucker's Algorithm to Color Circular Arc Graphs.

Mario Valencia-Pabon

SIAM J. Comput., 2003

2000

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.

Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Message Scheduling on Trees under a Generalized Line-Communication Model.

Dominique Barth, Mario Valencia-Pabon

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999