Recommendations
Cites work
- scientific article; zbMATH DE number 4154469 (Why is no real title available?)
- scientific article; zbMATH DE number 5764868 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 1947053 (Why is no real title available?)
- Algorithms and Computation
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- Approximating min sum set cover
- Approximation results for the optimum cost chromatic partition problem
- Complexity results for minimum sum edge coloring
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Minimal coloring and strength of graphs
- Minimum Color Sum of Bipartite Graphs
- On chromatic sums and distributed resource allocation
- On sum coloring of graphs
- On the cost chromatic number of outerplanar, planar, and line 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 coloring and interval graphs: A tight upper bound for the minimum number of colors
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- The complexity of chromatic strength and chromatic edge strength
Cited in
(8)- Minimum number of palettes in edge colorings
- On the performance guarantee of first fit for sum coloring
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Chromatic Edge Strength of Some Multigraphs
- On sum edge-coloring of regular, bipartite and split graphs
- Approximation and Online Algorithms
- 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\)
This page was built for publication: Minimum sum edge colorings of multicycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987666)
