Minimum sum set coloring of trees and line graphs of trees
From MaRDI portal
Publication:628310
DOI10.1016/j.dam.2010.11.018zbMath1209.05072OpenAlexW2105905055MaRDI QIDQ628310
Guillermo Durán, Javier Marenco, Mario Valencia-Pabon, Flavia Bonomo-Braberman
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/129448
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ An effective heuristic algorithm for sum coloring of graphs ⋮ On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Minimum sum edge colorings of multicycles
- Combinatorial algorithms for data migration to minimize average completion time
- Complexity results for minimum sum edge coloring
- On the sum coloring problem on interval graphs
- On chromatic sums and distributed resource allocation
- Multicoloring trees.
- Algorithm for the cost edge-coloring of trees
- The chromatic sum of a graph: history and recent developments
- On sum coloring of graphs
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Approximating min sum set cover
- Minimum sum multicoloring on the edges of trees
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- Minimum Color Sum of Bipartite Graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
- Sum Multicoloring of Graphs
- Approximation results for the optimum cost chromatic partition problem
This page was built for publication: Minimum sum set coloring of trees and line graphs of trees
