Minimum sum set coloring of trees and line graphs of trees

DOI10.1016/J.DAM.2010.11.018MaRDI QIDQ628310zbMATH OpenOpenAlexFDO

Authors Guillermo Durán, Javier Marenco, Mario Valencia-Pabon, Flavia Bonomo

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

zbMATH Keywords

treesgraph coloringline graphs of treesminimum sum coloringset-coloring

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the minimum sum coloring of P₄-sparse graphs
• Minimum sum coloring of \(P_{4}\)-sparse graphs
• Minimum sum multicoloring on the edges of trees
• Complexity results for minimum sum edge coloring
• Approximation and Online Algorithms

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 1947053 (Why is no real title available?)
• scientific article; zbMATH DE number 1929966 (Why is no real title available?)
• Algorithm for the cost edge-coloring of trees
• Approximating min sum set cover
• Approximation results for the optimum cost chromatic partition problem
• Combinatorial algorithms for data migration to minimize average completion time
• Complexity results for minimum sum edge coloring
• Edge-chromatic sum of trees and bounded cyclicity graphs
• Min Sum Edge Coloring in Multigraphs Via Configuration LP
• Minimum Color Sum of Bipartite Graphs
• Minimum sum edge colorings of multicycles
• Minimum sum multicoloring on the edges of trees
• Multicoloring trees.
• On chromatic sums and distributed resource allocation
• On sum coloring of graphs
• On the sum coloring problem on interval graphs
• Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
• Sum Multicoloring of Graphs
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• The chromatic sum of a graph: history and recent developments

Cited in

(4)

• 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
• Coloring of trees with minimum sum of colors

This page was built for publication: Minimum sum set coloring of trees and line graphs of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628310)