Edge coloring a k-tree into two smaller trees

DOI10.1002/(SICI)1097-0037(199707)29:4%3C191::AID-NET1%3E3.0.CO;2-AMaRDI QIDQ4347271zbMATH OpenOpenAlexFDO

Authors Dilip Chhajed

Publication date 7 August 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199707)29:4%3C191::aid-net1%3E3.0.co;2-a

zbMATH Keywords

edge coloring

Mathematics Subject Classification ID

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

Recommendations

• Edge-Coloring Partialk-Trees
• A parallel algorithm for edge-coloring partial k-trees
• A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees
• A polynomial-time algorithm for finding total colorings of partial \(k\)-trees
• A polynomial-time algorithm for finding total colorings of partial \(k\)-trees

Cited in

(3)

• scientific article; zbMATH DE number 3898919 (Why is no real title available?)
• Edge-Coloring Partialk-Trees
• A parallel algorithm for edge-coloring partial k-trees

This page was built for publication: Edge coloring a k-tree into two smaller trees

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