The following pages link to Mario Valencia-Pabon (Q324797):
Displaying 34 items.
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- Idomatic partitions of direct products of complete graphs (Q966052) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- The permutation-path coloring problem on trees. (Q1401295) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- On approximating the b-chromatic number (Q1765381) (← links)
- On the \(P_3\)-hull number of Kneser graphs (Q2048567) (← links)
- Diameter estimates for graph associahedra (Q2093260) (← links)
- On total and edge coloring some Kneser graphs (Q2168715) (← links)
- On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
- A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
- 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 graphs (Q2345859) (← links)
- The packing chromatic number of hypercubes (Q2352790) (← links)
- Independence and coloring properties of direct products of some vertex-transitive graphs (Q2509308) (← links)
- On the diameter of Kneser graphs (Q2581434) (← links)
- (Q2741507) (← links)
- Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
- On lower bounds for the b-chromatic number of connected bipartite graphs (Q2840743) (← links)
- (Q2918478) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs (Q4429674) (← links)
- (Q4508388) (← links)
- (Q4568175) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5890935) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780) (← links)
- The rotation distance of brooms (Q6201876) (← links)
