Maximizing the number of unused colors in the vertex coloring problem
DOI10.1016/0020-0190(94)00113-8zbMATH Open0809.05047OpenAlexW2095314925MaRDI QIDQ1336741FDOQ1336741
Publication date: 8 December 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00113-8
Recommendations
- Maximizing proper colorings on graphs
- Max-coloring of vertex-weighted graphs
- On the max coloring problem
- On the Max Coloring Problem
- Maximising \(H\)-colourings of graphs
- Maximum colorful cliques in vertex-colored graphs
- Maximum colorful cycles in vertex-colored graphs
- Maximizing the number of q -colorings
- Maximum number of colors: C-coloring and related problems
- On the maximum number of colorings of a graph
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (10)
- Title not available (Why is that?)
- Dual parameterization of Weighted Coloring
- Differential approximation algorithms for some combinatorial optimization problems
- Dual parameterization of weighted coloring
- Approximation algorithms for some vehicle routing problems
- Approximating k-set cover and complementary graph coloring
- Three-quarter approximation for the number of unused colors in graph coloring
- The maximum saving partition problem
- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation
This page was built for publication: Maximizing the number of unused colors in the vertex coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336741)
