Approximating minimum cocolorings.
From MaRDI portal
Publication:1853153
DOI10.1016/S0020-0190(02)00288-0zbMath1042.68091OpenAlexW1984312288WikidataQ56428494 ScholiaQ56428494MaRDI QIDQ1853153
Dieter Kratsch, Jean-Christophe Novelli, Fedor V. Fomin
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00288-0
Related Items
Extreme Witnesses and Their Applications, On compressing permutations and adaptive sorting, Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization, Fixed-parameter algorithms for the cocoloring problem, A tutorial on the use of graph coloring for some problems in robotics, Untangled monotonic chains and adaptive range search, Extreme witnesses and their applications, “Rent-or-Buy” Scheduling and Cost Coloring Problems, On minimum \(k\)-modal partitions of permutations, Succinct and Implicit Data Structures for Computational Geometry, Partitioning cographs into cliques and stable sets, \((p,k)\)-coloring problems in line graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some topics in cochromatic theory
- On chain and antichain families of a partially ordered set
- Geometric algorithms and combinatorial optimization
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- Some partitions associated with a partially ordered set
- On cocolourings and cochromatic numbers of graphs
- Chromatic number versus chromatic number in graphs with bounded clique number
- Critically cochromatic graphs
- Some extremal results in cochromatic and dichromatic theory
- Note on the cochromatic number of several surfaces
- Graph Classes: A Survey
- Subgraphs with a large cochromatic number
- The structure of Sperner k-families
