A linear time algorithm for edge coloring of binomial trees

DOI10.1016/0012-365X(95)00191-XzbMath0855.05059MaRDI QIDQ1916114

Konrad Piwakowski, Marek Kubale

Publication date: 12 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treeboundschromatic indexcoloringchromaticitybinomial tree

Mathematics Subject Classification ID

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

Related Items (1)

Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors

Cites Work

• Linear algorithms for edge-coloring trees and unicyclic graphs
• Scheduling File Transfers
• The NP-Completeness of Edge-Coloring
• On Edge Coloring Bipartite Graphs
• Unnamed Item

This page was built for publication: A linear time algorithm for edge coloring of binomial trees