Chromatic Edge Strength of Some Multigraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4154469 (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?)
- Approximating min sum set cover
- 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 interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- The complexity of chromatic strength and chromatic edge strength
Cited in
(5)
This page was built for publication: Chromatic Edge Strength of Some Multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503528)