The achromatic number of bounded degree trees (Q1584329): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q383737 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Keith J. Edwards / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4364806 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Harmonious Chromatic Number of Bounded Degree Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4352945 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of harmonious colouring for trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity Results for Bandwidth Minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5578801 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3126442 / rank | |||
Normal rank |
Revision as of 17:05, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The achromatic number of bounded degree trees |
scientific article |
Statements
The achromatic number of bounded degree trees (English)
0 references
2 November 2000
0 references
achromatic number
0 references
proper vertex colouring
0 references
polynomial-time algorithm
0 references
tree
0 references