A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees

DOI10.1007/s004530010017zbMath0971.05048OpenAlexW2019023526MaRDI QIDQ1578404

K. Fuse, Xiao Zhou, Takao Nishizeki

Publication date: 30 October 2001

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringpartial \(k\)-treeHalin graphsbounded treewidthlinear-time algorithm

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ A note on the \((g, f)\)-coloring

This page was built for publication: A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees