Nonrepetitive vertex colorings of graphs
| Autor: | Jochen Harant, Stanislav Jendrol |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Vertex (graph theory)
Discrete mathematics Mathematics::Combinatorics Foster graph Mathematics::Number Theory Theoretical Computer Science Brooks' theorem Planar graph Combinatorics Coxeter graph Edge coloring symbols.namesake Thue chromatic number Windmill graph Computer Science::Discrete Mathematics symbols Physics::Accelerator Physics Discrete Mathematics and Combinatorics Graph coloring Coloring of graphs Computer Science::Formal Languages and Automata Theory Mathematics |
| Zdroj: | Discrete Mathematics. 312:374-380 |
| ISSN: | 0012-365X |
| DOI: | 10.1016/j.disc.2011.09.027 |
| Popis: | We prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the facial Thue chromatic number of a plane graph in terms of its maximum degree. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect