Edge-chromatic sum of trees and bounded cyclicity graphs
From MaRDI portal
(Redirected from Publication:294800)
Recommendations
Cites work
- scientific article; zbMATH DE number 5145378 (Why is no real title available?)
- scientific article; zbMATH DE number 1163713 (Why is no real title available?)
- Faster Scaling Algorithms for Network Problems
- Investigation on interval edge-colorings of graphs
- Minimum Color Sum of Bipartite Graphs
- On chromatic sums and distributed resource allocation
- On the Complexity of Timetable and Multicommodity Flow Problems
- Scheduling File Transfers
Cited in
(17)- Sum list coloring graphs
- Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs.
- scientific article; zbMATH DE number 840700 (Why is no real title available?)
- Minimum sum multicoloring on the edges of trees
- Bounds of the sum of edge lengths in linear arrangements of trees
- Approximation and Online Algorithms
- On the performance guarantee of first fit for sum coloring
- Chromatic Edge Strength of Some Multigraphs
- On sum edge-coloring of regular, bipartite and split graphs
- Approximation and Online Algorithms
- scientific article; zbMATH DE number 1796973 (Why is no real title available?)
- Minimum sum set coloring of trees and line graphs of trees
- Minimum sum edge colorings of multicycles
- Complexity results for minimum sum edge coloring
- scientific article; zbMATH DE number 3857145 (Why is no real title available?)
- Total chromatic sum for trees
- Algorithm for the cost edge-coloring of trees
This page was built for publication: Edge-chromatic sum of trees and bounded cyclicity graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294800)