Chromatic number versus cochromatic number in graphs with bounded clique number
European Journal of Combinatorics
On cocolourings and cochromatic numbers of graphs
Discrete Applied Mathematics
Subgraphs with a large cochromatic number
Journal of Graph Theory
Graph classes: a survey
(p, k)-coloring problems in line graphs
Theoretical Computer Science
On minimum k-modal partitions of permutations
Journal of Discrete Algorithms
Untangled Monotonic Chains and Adaptive Range Search
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A comparative study of efficient algorithms for partitioning a sequence into monotone subsequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
"Rent-or-buy" scheduling and cost coloring problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Range queries over untangled chains
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Untangled monotonic chains and adaptive range search
Theoretical Computer Science
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On minimum k-modal partitions of permutations
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Partitioning cographs into cliques and stable sets
Discrete Optimization
Polar permutation graphs are polynomial-time recognisable
European Journal of Combinatorics
Information and Computation
On compressing permutations and adaptive sorting
Theoretical Computer Science
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
| Hi-index | 0.90 |
A cocoloring of a graph G is a partition of the vertex set of G such that each set of the partition is either a clique or an independent set in G. Some special cases of the minimum cocoloring problem are of particular interest.We provide polynomial-time algorithms to approximate a minimum cocoloring on graphs, partially ordered sets and sequences. In particular, we obtain an efficient algorithm to approximate within a factor of 1.71 a minimum partition of a partially ordered set into chains and antichains, and a minimum partition of a sequence into increasing and decreasing subsequences.