scientific article; zbMATH DE number 5279381
From MaRDI portal
Publication:5387684
zbMath1153.05320MaRDI QIDQ5387684
Publication date: 27 May 2008
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85/showToc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
First-fit colorings of graphs with no cycles of a prescribed even length ⋮ Time-approximation trade-offs for inapproximable problems ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Unnamed Item ⋮ Computational aspects of greedy partitioning of graphs ⋮ On Computational Aspects of Greedy Partitioning of Graphs ⋮ Minimum order of graphs with given coloring parameters ⋮ Complexity of Grundy coloring and its variants ⋮ Supernovae and cosmology
