Intervalizing k-colored graphs

DOI10.1007/3-540-60084-1_65zbMath1412.68162WikidataQ59567986 ScholiaQ59567986MaRDI QIDQ4645169

Hans L. Bodlaender, Babette de Fluiter

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_65

zbMATH Keywords

interval graph; path decomposition; biconnected component; linear-time algorithm; input graph

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs