Edge-chromatic sum of trees and bounded cyclicity graphs
From MaRDI portal
Publication:294800
DOI10.1016/S0020-0190(00)00072-7zbMATH Open1339.68116MaRDI QIDQ294800FDOQ294800
Authors: Krzysztof Giaro, Marek Kubale 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000727?np=y
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Faster Scaling Algorithms for Network Problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- Investigation on interval edge-colorings of graphs
- Scheduling File Transfers
- On chromatic sums and distributed resource allocation
- Title not available (Why is that?)
- Minimum Color Sum of Bipartite Graphs
- Title not available (Why is that?)
Cited In (17)
- Sum list coloring graphs
- Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs.
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Minimum sum set coloring of trees and line graphs of trees
- Minimum sum edge colorings of multicycles
- Complexity results for minimum sum edge coloring
- Title not available (Why is that?)
- 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)
