Some results in square-free and strong square-free edge-colorings of graphs
From MaRDI portal
Publication:879399
DOI10.1016/j.disc.2006.09.019zbMath1118.05037MaRDI QIDQ879399
Sundar Vishwanathan, K. S. Sudeep
Publication date: 11 May 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.019
05C15: Coloring of graphs and hypergraphs
Cites Work
- Unnamed Item
- Avoidable patterns in strings of symbols
- Square-free and cube-free colorings of the ordinals
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Open Problems in Pattern Avoidance
- Nonrepetitive colorings of graphs
- A Characterization of the Morse Minimal Set
- Multiplicative properties of the Thue-Morse sequence