Fractional Thue chromatic number of graphs
From MaRDI portal
Publication:906448
DOI10.1016/j.dam.2015.06.026zbMath1329.05123OpenAlexW1266706105MaRDI QIDQ906448
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.06.026
Related Items (1)
Cites Work
- Nonrepetitive colouring via entropy compression
- Nonrepetitive vertex colorings of graphs
- Nonrepetitive colorings of trees
- Nonrepetitive colorings of graphs -- a survey
- Nonrepetitive colorings of graphs of bounded tree-width
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Facial Nonrepetitive Vertex Coloring of Plane Graphs
- Automatic Sequences
- Nonrepetitive colorings of graphs
This page was built for publication: Fractional Thue chromatic number of graphs