Minimum sum edge colorings of multicycles
From MaRDI portal
Publication:987666
DOI10.1016/j.dam.2009.04.020zbMath1209.05073OpenAlexW1979182429MaRDI QIDQ987666
Jean Cardinal, Mario Valencia-Pabon, Vlady Ravelomanana
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.020
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
On the performance guarantee of first fit for sum coloring ⋮ A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ On sum edge-coloring of regular, bipartite and split graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-chromatic sum of trees and bounded cyclicity graphs
- The complexity of chromatic strength and chromatic edge strength
- Complexity results for minimum sum edge coloring
- On the sum coloring problem on interval graphs
- On chromatic sums and distributed resource allocation
- On sum coloring of graphs
- 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
- Approximating min sum set cover
- Minimal coloring and strength of graphs
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- Minimum Color Sum of Bipartite Graphs
- On the cost chromatic number of outerplanar, planar, and line graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
- Approximation results for the optimum cost chromatic partition problem
- Algorithms and Computation
This page was built for publication: Minimum sum edge colorings of multicycles
