The minimum color sum of bipartite graphs

DOI10.1007/3-540-63165-8_227MaRDI QIDQ4572002zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Guy Kortsarz

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_227

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Minimum Color Sum of Bipartite Graphs
• On sum edge-coloring of regular, bipartite and split graphs
• scientific article; zbMATH DE number 1163713
• scientific article; zbMATH DE number 1947053
• On sum coloring of graphs

Cites work

• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• Minimum Color Sum of Bipartite Graphs
• Upper bounds for static resource allocation in a distributed system

Cited in

(7)

• On the probabilistic minimum coloring and minimum \(k\)-coloring
• Sum coloring of bipartite graphs with bounded degree
• A note on the strength and minimum color sum of bipartite graphs
• A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
• A matched approximation bound for the sum of a greedy coloring
• Minimax relations for the partial q-colorings of a graph
• scientific article; zbMATH DE number 5904019 (Why is no real title available?)

This page was built for publication: The minimum color sum of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572002)