A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS

DOI10.1142/S0129054113500020zbMath1269.05102OpenAlexW1991699769MaRDI QIDQ2841989

Kim S. Larsen, Martin R. Ehmsen

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113500020

zbMATH Keywords

graph coloringgraph algorithmsinterval graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Parameterized coloring problems on chordal graphs
• List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures
• Precoloring extension. I: Interval graphs

This page was built for publication: A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS