Linear algorithms for edge-coloring trees and unicyclic graphs
type: Item
instance of: scholarly article
title: Linear algorithms for edge-coloring trees and unicyclic graphs
zbMATH Open document ID: 0415.68030
DOI: 10.1016/0020-0190(79)90049-8
author: Stephen T. Hedetniemi
author: Sandra M. Hedetniemi
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3646300
zbMATH Keywords: edge-coloring
zbMATH Keywords: tree
zbMATH Keywords: unicyclic graph
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90049-8
OpenAlex ID: W1974473207
cites work: On small graphs critical with respect to edge colourings
cites work: Using euler partitions to edge color bipartite multigraphs
cites work: Q4198056
cites work: Q5661516
description: scientific article; zbMATH DE number 3646300