Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On small graphs critical with respect to edge colourings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using euler partitions to edge color bipartite multigraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661516 / rank | |||
Normal rank | |||
Latest revision as of 02:09, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear algorithms for edge-coloring trees and unicyclic graphs |
scientific article |
Statements
Linear algorithms for edge-coloring trees and unicyclic graphs (English)
0 references
1979
0 references
edge-coloring
0 references
tree
0 references
unicyclic graph
0 references
computational complexity
0 references
