A note on the strength and minimum color sum of bipartite graphs

DOI10.1016/J.DAM.2009.03.008zbMath1211.05042OpenAlexW2029462843MaRDI QIDQ967294

Adrian Kosowski

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.03.008

zbMATH Keywords

graph coloringbipartite graphscolor sumMehrabadi's conjecturestrength of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) ⋮ Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition

Cites Work

• The complexity of chromatic strength and chromatic edge strength
• The chromatic sum of a graph: history and recent developments
• Sum coloring of bipartite graphs with bounded degree
• Minimal coloring and strength of graphs
• Coloring of trees with minimum sum of colors

This page was built for publication: A note on the strength and minimum color sum of bipartite graphs