scientific article; zbMATH DE number 1947053
From MaRDI portal
Publication:4411283
zbMath1013.90129MaRDI QIDQ4411283
Robert Janczewski, Michał Małafiejski, Marek Kubale, Krzysztof Giaro
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620135.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) ⋮ 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 ⋮ Unnamed Item ⋮ Comparison of sum choice number with chromatic sum ⋮ On the minimum sum coloring of \(P_4\)-sparse graphs ⋮ Complexity results for minimum sum edge coloring ⋮ On sum coloring and sum multi-coloring for restricted families of graphs ⋮ Minimum Sum Coloring of P4-sparse graphs
