Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1096.68684OpenAlexW2488008928MaRDI QIDQ5311104

Magnús M. Halldórsson, Guy Kortsarz

Publication date: 22 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99679

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

On the performance guarantee of first fit for sum coloring ⋮ Generalised chromatic polynomials of graphs from heaps of pieces ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Minimum sum coloring problem: upper bounds for the chromatic strength ⋮ Graph multi-coloring for a job scheduling application ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ A study on free roots of Borcherds-Kac-Moody Lie superalgebras ⋮ Root multiplicities for Borcherds algebras and graph coloring ⋮ Solving a multicoloring problem with overlaps using integer programming ⋮ Chromatic symmetric function of graphs from Borcherds algebras ⋮ Profit maximization in flex-grid all-optical networks ⋮ Profit Maximization in Flex-Grid All-Optical Networks ⋮ On the interval chromatic number of proper interval graphs

This page was built for publication: Mathematical Foundations of Computer Science 2004