Linear algorithms for edge-coloring trees and unicyclic graphs
- 5 October 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 9 (3) , 110-112
- https://doi.org/10.1016/0020-0190(79)90049-8
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Using euler partitions to edge color bipartite multigraphsInternational Journal of Parallel Programming, 1976
- On small graphs critical with respect to edge colouringsDiscrete Mathematics, 1976