Mario Valencia-Pabon

From MaRDI portal
Person:324797

Available identifiers

zbMath Open valencia-pabon.mario-eMaRDI QIDQ324797

List of research outcomes





PublicationDate of PublicationType
On the total chromatic number of the direct product of cycles and complete graphs2024-06-05Paper
The rotation distance of brooms2024-03-26Paper
Diameter estimates for graph associahedra2022-11-07Paper
On total and edge coloring some Kneser graphs2022-08-26Paper
On restricted completions of chordal and trivially perfect graphs2022-04-14Paper
On the \(P_3\)-hull number of Kneser graphs2021-08-09Paper
On the \(P_3\)-hull number of Hamming graphs2020-06-05Paper
A note on homomorphisms of Kneser hypergraphs2020-01-15Paper
Independence number of products of Kneser graphs2019-02-20Paper
https://portal.mardi4nfdi.de/entity/Q45681752018-06-15Paper
\(k\)-tuple colorings of the Cartesian product of graphs2018-05-24Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2017-12-20Paper
Shifts of the stable Kneser graphs and hom-idempotence2017-03-28Paper
\(k\)-tuple chromatic number of the Cartesian product of graphs2016-10-17Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2016-10-17Paper
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs2015-10-19Paper
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs2015-10-16Paper
Complexity of the cluster deletion problem on subclasses of chordal graphs2015-09-16Paper
The packing chromatic number of hypercubes2015-07-06Paper
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs2015-05-21Paper
On the minimum sum coloring of \(P_4\)-sparse graphs2014-09-19Paper
On lower bounds for the \(b\)-chromatic number of connected bipartite graphs2013-07-23Paper
Minimum sum coloring of \(P_{4}\)-sparse graphs2013-07-19Paper
Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs2012-10-06Paper
A distributed approximation algorithm for the minimum degree minimum weight spanning trees2012-07-26Paper
Minimum sum set coloring of trees and line graphs of trees2011-03-10Paper
Minimum sum edge colorings of multicycles2010-08-13Paper
Idomatic partitions of direct products of complete graphs2010-04-27Paper
On the b-coloring of cographs and \(P_{4}\)-sparse graphs2009-12-09Paper
Chromatic Edge Strength of Some Multigraphs2008-06-05Paper
Independence and coloring properties of direct products of some vertex-transitive graphs2006-10-19Paper
On the diameter of Kneser graphs2006-01-10Paper
On approximating the b-chromatic number2005-02-23Paper
Revisiting Tucker's Algorithm to Color Circular Arc Graphs2003-09-28Paper
The permutation-path coloring problem on trees.2003-08-17Paper
Revisiting Tucker's algorithm to color circular-arc graphs2001-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45083882001-08-06Paper
Exact distance Kneser graphsN/APaper

Research outcomes over time

This page was built for person: Mario Valencia-Pabon