Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
From MaRDI portal
Publication:3439562
DOI10.1016/j.endm.2007.01.006zbMath1293.05120arXivmath/0511262MaRDI QIDQ3439562
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511262
\(\mathcal F\)-free colourings of the Cartesian product of graphs; maximum density of a \(k\)-multiplicative Sidon set
Related Items
Coloring the square of the Cartesian product of two cycles, On the acyclic chromatic number of Hamming graphs
Cites Work
- Unnamed Item
- Acyclic and \(k\)-distance coloring of the grid
- On acyclic colorings of planar graphs
- Coloring with no 2-colored \(P_4\)'s
- A relative of the Thue-Morse sequence
- Tree-depth, subgraph coloring and homomorphism bounds
- Star coloring of graphs
- Graphs with Given Group and Given Graph-Theoretical Properties