Pages that link to "Item:Q2195220"
From MaRDI portal
The following pages link to Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220):
Displaying 12 items.
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- A General Framework for Hypergraph Coloring (Q5093586) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- Counting colorings of triangle-free graphs (Q6038582) (← links)
- Graphs of low average degree without independent transversals (Q6093156) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)
- Optimization in graphical small cancellation theory (Q6197706) (← links)
- Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters (Q6201902) (← links)
- Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics (Q6635179) (← links)
- Proper conflict-free coloring of graphs with large maximum degree (Q6654118) (← links)
