Mario Valencia-Pabon

According to our database1, Mario Valencia-Pabon authored at least 33 papers between 1999 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the P3-hull number of Hamming graphs.
Discret. Appl. Math., 2020

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

A note on homomorphisms of Kneser hypergraphs.
Appl. Math. Comput., 2020

2019
Independence number of products of Kneser graphs.
Discret. Math., 2019

2018
k-tuple colorings of the Cartesian product of graphs.
Discret. Appl. Math., 2018

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

2017
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2017

Shifts of the stable Kneser graphs and hom-idempotence.
Eur. J. Comb., 2017

2015
Complexity of the cluster deletion problem on subclasses of chordal graphs.
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.
Inf. Process. Lett., 2015

k-tuple chromatic number of the cartesian product of graphs.
Electron. Notes Discret. Math., 2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electron. Notes Discret. Math., 2015

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

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

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

2013
On the packing chromatic number of hypercubes.
Electron. Notes Discret. Math., 2013

2011
On lower bounds for the b-chromatic number of connected bipartite graphs.
Electron. Notes Discret. Math., 2011

LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium.
Electron. Notes Discret. Math., 2011

Minimum sum set coloring of trees and line graphs of trees.
Discret. Appl. Math., 2011

2010
Idomatic partitions of direct products of complete graphs.
Discret. Math., 2010

Minimum sum edge colorings of multicycles.
Discret. Appl. Math., 2010

2009
On the b-Coloring of Cographs and <i>P</i><sub>4</sub>-Sparse Graphs.
Graphs Comb., 2009

Minimum Sum Coloring of P<sub>4</sub>-sparse graphs.
Electron. Notes Discret. Math., 2009

Minimum Sum Set Coloring on some Subclasses of Block Graphs.
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.
J. Parallel Distributed Comput., 2008

Chromatic Edge Strength of Some Multigraphs.
Electron. Notes Discret. Math., 2008

2006
Independence and coloring properties of direct products of some vertex-transitive graphs.
Discret. Math., 2006

2005
On the diameter of Kneser graphs.
Discret. Math., 2005

On approximating the b-chromatic number.
Discret. Appl. Math., 2005

2003
The permutation-path coloring problem on trees.
Theor. Comput. Sci., 2003

2001
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs.
Electron. Notes Discret. Math., 2001

2000
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999
Message Scheduling on Trees under a Generalized Line-Communication Model.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999


  Loading...