A linear time algorithm for edge coloring of binomial trees
- 6 April 1996
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 150 (1-3) , 247-256
- https://doi.org/10.1016/0012-365x(95)00191-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer SystemsIEEE Transactions on Computers, 1985
- Scheduling File TransfersSIAM Journal on Computing, 1985
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Linear algorithms for edge-coloring trees and unicyclic graphsInformation Processing Letters, 1979