scientific article; zbMATH DE number 1929966
From MaRDI portal
Publication:4708601
zbMath1014.68117MaRDI QIDQ4708601
Publication date: 18 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200532.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Multicoloring trees. ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ A polynomial algorithm for some preemptive multiprocessor task scheduling problems ⋮ Minimum sum multicoloring on the edges of trees ⋮ List edge multicoloring in graphs with few cycles ⋮ On sum coloring and sum multi-coloring for restricted families of graphs
This page was built for publication:
