| Publication | Date of Publication | Type |
|---|
On the total chromatic number of the direct product of cycles and complete graphs
RAIRO. Operations Research | 2024-06-05 | Paper |
The rotation distance of brooms
European Journal of Combinatorics | 2024-03-26 | Paper |
Diameter estimates for graph associahedra
Annals of Combinatorics | 2022-11-07 | Paper |
On total and edge coloring some Kneser graphs
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
| On restricted completions of chordal and trivially perfect graphs | 2022-04-14 | Paper |
On the \(P_3\)-hull number of Kneser graphs
The Electronic Journal of Combinatorics | 2021-08-09 | Paper |
On the \(P_3\)-hull number of Hamming graphs
Discrete Applied Mathematics | 2020-06-05 | Paper |
A note on homomorphisms of Kneser hypergraphs
Applied Mathematics and Computation | 2020-01-15 | Paper |
Independence number of products of Kneser graphs
Discrete Mathematics | 2019-02-20 | Paper |
| On the \((k,i)\)-coloring of cacti and complete graphs. | 2018-06-15 | Paper |
\(k\)-tuple colorings of the Cartesian product of graphs
Discrete Applied Mathematics | 2018-05-24 | Paper |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Discrete Applied Mathematics | 2017-12-20 | Paper |
Shifts of the stable Kneser graphs and hom-idempotence
European Journal of Combinatorics | 2017-03-28 | Paper |
| \(k\)-tuple chromatic number of the Cartesian product of graphs | 2016-10-17 | Paper |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Electronic Notes in Discrete Mathematics | 2016-10-17 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Algorithmica | 2015-10-19 | Paper |
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Complexity of the cluster deletion problem on subclasses of chordal graphs
Theoretical Computer Science | 2015-09-16 | Paper |
The packing chromatic number of hypercubes
Discrete Applied Mathematics | 2015-07-06 | Paper |
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
Information Processing Letters | 2015-05-21 | Paper |
On the minimum sum coloring of \(P_4\)-sparse graphs
Graphs and Combinatorics | 2014-09-19 | Paper |
On lower bounds for the \(b\)-chromatic number of connected bipartite graphs
Electronic Notes in Discrete Mathematics | 2013-07-23 | Paper |
Minimum sum coloring of \(P_{4}\)-sparse graphs
Electronic Notes in Discrete Mathematics | 2013-07-19 | Paper |
Some problems on idomatic partitions and \(b\)-colorings of direct products of complete graphs
Matemática Contemporânea | 2012-10-06 | Paper |
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Journal of Parallel and Distributed Computing | 2012-07-26 | Paper |
Minimum sum set coloring of trees and line graphs of trees
Discrete Applied Mathematics | 2011-03-10 | Paper |
Minimum sum edge colorings of multicycles
Discrete Applied Mathematics | 2010-08-13 | Paper |
Idomatic partitions of direct products of complete graphs
Discrete Mathematics | 2010-04-27 | Paper |
On the b-coloring of cographs and \(P_{4}\)-sparse graphs
Graphs and Combinatorics | 2009-12-09 | Paper |
Chromatic Edge Strength of Some Multigraphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Independence and coloring properties of direct products of some vertex-transitive graphs
Discrete Mathematics | 2006-10-19 | Paper |
On the diameter of Kneser graphs
Discrete Mathematics | 2006-01-10 | Paper |
On approximating the b-chromatic number
Discrete Applied Mathematics | 2005-02-23 | Paper |
Revisiting Tucker's Algorithm to Color Circular Arc Graphs
SIAM Journal on Computing | 2003-09-28 | Paper |
The permutation-path coloring problem on trees.
Theoretical Computer Science | 2003-08-17 | Paper |
| Revisiting Tucker's algorithm to color circular-arc graphs | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1512699 (Why is no real title available?) | 2001-08-06 | Paper |
Exact distance Kneser graphs
(available as arXiv preprint) | N/A | Paper |
