Generalized edge-colorings of weighted graphs

DOI10.1142/S1793830916500154zbMath1333.05122OpenAlexW2234165224MaRDI QIDQ2798333

Yuji Obata, Takao Nishizeki

Publication date: 12 April 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830916500154

zbMATH Keywords

algorithmapproximationedge coloringweighted graphchromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Channel assignment on graphs of bounded treewidth
• Bandwidth consecutive multicolorings of graphs
• Approximation Algorithms for Bandwidth Consecutive Multicolorings
• Efficient parallel algorithms for edge coloring problems
• The NP-Completeness of Edge-Coloring
• A Theorem on Coloring the Lines of a Network
• Scheduling

This page was built for publication: Generalized edge-colorings of weighted graphs