Approximation results for the optimum cost chromatic partition problem
DOI10.1007/3-540-63165-8_226zbMATH Open1401.68353OpenAlexW2281633950MaRDI QIDQ4572001FDOQ4572001
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_226
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The maximum k-colorable subgraph problem for chordal graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Algorithms for maximumk-colorings andk-coverings of transitive graphs
- On a graph partition problem with application to VLSI layout
- On chain and antichain families of a partially ordered set
- Approximation results for the optimum cost chromatic partition problem
Cited In (22)
- Minimum sum coloring problem: upper bounds for the chromatic strength
- On coloring problems with local constraints
- Hard coloring problems in low degree planar bipartite graphs
- Exploring the complexity boundary between coloring and list-coloring
- Minimum sum multicoloring on the edges of trees
- 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
- Precoloring extension of co-Meyniel graphs
- Approximation results for the optimum cost chromatic partition problem
- \(b\)-coloring parameterized by clique-width
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- On a graph partition problem with application to VLSI layout
- On chromatic sums and distributed resource allocation
- Minimum sum set coloring of trees and line graphs of trees
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
- Integer programming in parameterized complexity: five miniatures
- Minimum sum edge colorings of multicycles
- The \(d\)-precoloring problem for \(k\)-degenerate graphs
- Integer Programming in Parameterized Complexity: Three Miniatures.
- On coloring problems with local constraints
- Minimum sum coloring of \(P_{4}\)-sparse graphs
- Approximation Results for the Optimum Cost Chromatic Partition Problem
This page was built for publication: Approximation results for the optimum cost chromatic partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572001)
