Nonrepetitive colorings of graphs of bounded tree-width

Discrete Mathematics

Volumn 308, Issue 19, 2008, Pages 4473-4478

  Kündgen, André ^a   Pelsmajer, Michael J ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b Illinois Institute of Technology   (United States)

Author keywords

Repetition; Squarefree coloring; Thue number; Tree width

Indexed keywords

MICROFLUIDICS;

OF GRAPHS; TREE WIDTH;

TREES (MATHEMATICS);

EID: 45249090594     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.08.043     Document Type: Article

References (10)

1. 4's. Electron. J. Combin. 11 1 (2004) #R26
2. Alon N., Grytczuk J., Hałuszczak M., and Riordan O. Nonrepetitive colorings of graphs. Random Struct. Alg. 21 (2002) 336-346
3. Diestel R. Graph Theory. third ed. (2005), Springer, Heidelberg, New York
4. Fertin G., Raspaud A., and Reed B. On star coloring of graphs. Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Lecture Notes in Computer Science vol. 2204 (2001), Springer, Berlin 140-153
5. J. Grytczuk, Thue type problems for graphs, points and numbers, Math., to appear.
6. Nešetřil J., and Ossona de Mendez P. Colorings and homomorphisms of minor closed classes. In: Aronov B., Basu S., Pach J., and Sharir M. (Eds). Discrete and Computational Geometry: The Goodman-Pollack Festschrift (2003), Springer, Berlin 651-664
7. Robertson N., and Seymour P.D. Graph minors V: Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986) 92-114
8. Robertson N., Seymour P.D., and Thomas R. Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994) 323-348
9. Thue A. Über unendliche Zahlenreihen. Norske Vid Selsk Skr I Mat Nat Kl Christiana 7 (1906) 1-22
10. West D.B. Introduction to Graph Theory. second ed. (2001), Prentice-Hall, Upper Saddle River, NJ