A linear algorithm to color \(i\)-triangulated graphs

DOI10.1016/S0020-0190(99)00041-1zbMath0990.05113OpenAlexW2053319936MaRDI QIDQ1606929

F. Roussel, Irena Rusu

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00041-1

zbMATH Keywords

greedy coloring algorithmlexicographic breadth-first search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Classes of perfect graphs

This page was built for publication: A linear algorithm to color \(i\)-triangulated graphs