|
| |
|
|
A006670
|
|
Chromatic number of path with n nodes.
(Formerly M0252)
|
|
0
| |
|
|
1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 7
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| This cannot be the ordinary chromatic number, which is 2 for paths and 2 or 3 for cycles (A006671). Should "edge-distinguishing" be in the title? - Keith Briggs (keith.briggs(AT)bt.com), Feb 22 2006
|
|
|
REFERENCES
| K. Al-Wahabi, R. Bari, F. Harary and D. Ullman, The edge-distinguishing chromatic number of paths and cycles, pp. 17-22 of Graph Theory in Memory of G. A. Dirac (Sandbjerg, 1985). Edited by L. D. Andersen et al., Annals of Discrete Mathematics, 41. North-Holland Publishing Co., Amsterdam-New York, 1989.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
CROSSREFS
| Sequence in context: A005707 A087828 A110867 * A132914 A060646 A103298
Adjacent sequences: A006667 A006668 A006669 * A006671 A006672 A006673
|
|
|
KEYWORD
| nonn,more
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
