scientific article; zbMATH DE number 1522942

zbMATH Open0955.05096MaRDI QIDQ4511238FDOQ4511238

Authors: Shuji Isobe, Xiao Zhou, Takao Nishizeki 

Publication date: 12 February 2001

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

treewidthgraph algorithmsgraph coloringtotal coloringpartial \(k\)-trees

Mathematics Subject Classification ID

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

Cited In (6)

• A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
• Algorithms for finding f-colorings of partial k-trees
• A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
• List total colorings of series-parallel graphs
• Title not available (Why is that?)

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)