Minimum sum edge colorings of multicycles
From MaRDI portal
Publication:987666
DOI10.1016/J.DAM.2009.04.020zbMATH Open1209.05073OpenAlexW1979182429MaRDI QIDQ987666FDOQ987666
Authors: Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- On chromatic sums and distributed resource allocation
- Edge-chromatic sum of trees and bounded cyclicity graphs
- Minimum Color Sum of Bipartite Graphs
- Approximating min sum set cover
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Title not available (Why is that?)
- On the cost chromatic number of outerplanar, planar, and line graphs
- Complexity results for minimum sum edge coloring
- On the sum coloring problem on interval graphs
- On sum coloring of graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
- Title not available (Why is that?)
- Approximation results for the optimum cost chromatic partition problem
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- Title not available (Why is that?)
- The complexity of chromatic strength and chromatic edge strength
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Algorithms and Computation
- Minimal coloring and strength of graphs
Cited In (7)
- 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
- 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\)
- Minimum number of palettes in edge colorings
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)