scientific article; zbMATH DE number 1522942

MaRDI QIDQ4511238zbMATH OpenFDO

Authors Shuji Isobe, Xiao Zhou, Takao Nishizeki

Publication date 12 February 2001

zbMATH Keywords

graph algorithmsgraph coloringpartial \(k\)-treestotal coloringtreewidth

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1262791
• A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
• A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees
• Edge-Coloring Partialk-Trees
• scientific article; zbMATH DE number 2089998

Cited in

(8)

• A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees
• List total colorings of series-parallel graphs
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
• scientific article; zbMATH DE number 1262791 (Why is no real title available?)
• scientific article; zbMATH DE number 2089998 (Why is no real title available?)
• A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
• Algorithms for finding f-colorings of partial k-trees

This page was built for publication:

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