Rainbows in the hypercube
From MaRDI portal
Publication:879943
DOI10.1007/S00373-007-0691-6zbMath1118.05028OpenAlexW2070654897MaRDI QIDQ879943
Heiko Harborth, Meinhard Möller, Ingo Schiermeyer, Arnfried Kemnitz, Maria A. Axenovich
Publication date: 10 May 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0691-6
Related Items (12)
Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Rainbow copies of \(C_4\) in edge-colored hypercubes ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Coloring the cube with rainbow cycles ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Anti-Ramsey problems for cycles ⋮ Avoiding rainbow 2-connected subgraphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ On heterochromatic out-directed spanning trees in tournaments ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ Hypercube 1-factorizations from extended Hamming codes
Cites Work
- Edge-colorings of complete graphs that avoid polychromatic trees
- Rainbow numbers for matchings and complete graphs
- E 11 and M theory
- Bipartite anti-Ramsey numbers of cycles
- Subgraphs of a hypercube containing no small even cycles
- On an anti‐Ramsey property of Ramanujan graphs
- An anti-Ramsey theorem
- Unnamed Item
This page was built for publication: Rainbows in the hypercube
