Edge coloring a k-tree into two smaller trees

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A" /><191::AID-NET1>3.0.CO;2-A 10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-AzbMath0882.68108OpenAlexW2054262128MaRDI QIDQ4347271

Dilip Chhajed

Publication date: 7 August 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199707)29:4<191::aid-net1>3.0.co;2-a

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)

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