Minimal coloring and strength of graphs
From MaRDI portal
Publication:1974540
DOI10.1016/S0012-365X(99)00319-2zbMath0957.05041OpenAlexW2089342001MaRDI QIDQ1974540
Hossein Hajiabolhassan, M. L. Mehrabadi, R. Tusserkani
Publication date: 15 March 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00319-2
Related Items
Minimum sum coloring problem: upper bounds for the chromatic strength, New variable neighborhood search method for minimum sum coloring problem on simple graphs, Chromatic Edge Strength of Some Multigraphs, On sum edge-coloring of regular, bipartite and split graphs, A branch-and-price algorithm for the minimum sum coloring problem, An effective heuristic algorithm for sum coloring of graphs, A note on the strength and minimum color sum of bipartite graphs, Unnamed Item, Minimum sum edge colorings of multicycles, A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph, On sum coloring of graphs, Sum coloring and interval graphs: A tight upper bound for the minimum number of colors, Tabular graphs and chromatic sum
