Edge coloring a k-tree into two smaller trees

DOI10.1002/(SICI)1097-0037(199707)29:4%3C191::AID-NET1%3E3.0.CO;2-AzbMATH Open0882.68108OpenAlexW2054262128MaRDI QIDQ4347271FDOQ4347271

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

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
• scientific article; zbMATH DE number 1262791

zbMATH Keywords

edge coloring

Mathematics Subject Classification ID

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

Cited In (3)

• A parallel algorithm for edge-coloring partial k-trees
• Edge-Coloring Partialk-Trees
• Title not available (Why is that?)

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)