Electronic Resource
Springer
Graphs and combinatorics
12 (1996), S. 221-230
ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract This paper shows that the graphW(n, n − 2, k) is chromatically unique for any even integern ≥ 6 and any integerk ≥ 1.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01858456
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |