Multicoloring: Problems and techniques

DOI10.1007/978-3-540-28629-5_2MaRDI QIDQ5311104zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 6004918
• Multicoloring planar graphs and partial k-trees
• Sum Multicoloring of Graphs
• Adaptive multicolouring
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

Cited in

(20)

• Adaptive multicolouring
• On the performance guarantee of first fit for sum coloring
• Graph multi-coloring for a job scheduling application
• Root multiplicities for Borcherds algebras and graph coloring
• Chromatic symmetric function of graphs from Borcherds algebras
• Generalised chromatic polynomials of graphs from heaps of pieces
• Profit maximization in flex-grid all-optical networks
• On the interval chromatic number of proper interval graphs
• Minimum sum coloring problem: upper bounds for the chromatic strength
• Profit maximization in flex-grid all-optical networks
• Vectorial solutions to list multicoloring problems on graphs
• Mixing Color Coding-Related Techniques
• Multicolour Discrepancies
• Multicoloring of graphs to secure a secret
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• Tight lower bounds for the complexity of multicoloring
• Parameterized complexity for iterated type partitions and modular-width
• A study on free roots of Borcherds-Kac-Moody Lie superalgebras
• The parameterized complexity of the properly colored spanning tree problem
• Solving a multicoloring problem with overlaps using integer programming

This page was built for publication: Multicoloring: Problems and techniques

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