scientific article; zbMATH DE number 3898919

zbMATH Open0564.05027MaRDI QIDQ3677784FDOQ3677784

Authors: Vytautas Štuikys, Gintaras Sabalyauskas 

Publication date: 1983

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

Recommendations

• A linear time algorithm for edge coloring of binomial trees
• Edge coloring a k-tree into two smaller trees
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
• scientific article; zbMATH DE number 1796973
• Algorithm for the cost edge-coloring of trees

zbMATH Keywords

algorithmCADcomputer-aided-designcolouring edges of a tree

Mathematics Subject Classification ID

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

Cited In (2)

• Computing edge irregularity strength of complete $m$-ary trees
• Algorithms for coloring quadtrees

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 Q3677784)