Edge-chromatic sum of trees and bounded cyclicity graphs

DOI10.1016/S0020-0190(00)00072-7zbMath1339.68116MaRDI QIDQ294800

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

zbMATH Keywords

edge coloringgraph algorithmsedge-chromatic sum

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

On the performance guarantee of first fit for sum coloring ⋮ Chromatic Edge Strength of Some Multigraphs ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ On sum edge-coloring of regular, bipartite and split graphs ⋮ Minimum sum edge colorings of multicycles ⋮ Sum list coloring graphs ⋮ Minimum sum multicoloring on the edges of trees ⋮ Complexity results for minimum sum edge coloring

Cites Work

• Investigation on interval edge-colorings of graphs
• On chromatic sums and distributed resource allocation
• Scheduling File Transfers
• On the Complexity of Timetable and Multicommodity Flow Problems
• Minimum Color Sum of Bipartite Graphs
• Faster Scaling Algorithms for Network Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-chromatic sum of trees and bounded cyclicity graphs