Rainbows in the hypercube
From MaRDI portal
Publication:879943
DOI10.1007/S00373-007-0691-6zbMATH Open1118.05028OpenAlexW2070654897MaRDI QIDQ879943FDOQ879943
Authors: Heiko Harborth, Arnfried Kemnitz, Meinhard Möller, Ingo Schiermeyer, Maria 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
Recommendations
Cites Work
- \(E_{11}\) and M theory
- Edge-colorings of complete graphs that avoid polychromatic trees
- Rainbow numbers for matchings and complete graphs
- Bipartite anti-Ramsey numbers of cycles
- Title not available (Why is that?)
- An anti-Ramsey theorem
- On an anti‐Ramsey property of Ramanujan graphs
- Subgraphs of a hypercube containing no small even cycles
Cited In (17)
- A note on short cycles in a hypercube
- Rainbow copies of \(C_4\) in edge-colored hypercubes
- Rainbow coloring the cube
- Anti-Ramsey numbers in complete split graphs
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- Anti-Ramsey number of Hanoi graphs
- Rainbow generalizations of Ramsey theory: A survey
- Turán’s Theorem in the Hypercube
- Anti-Ramsey problems for cycles
- Vertex rainbow numbers for cube graphs
- Symmetric Layer-Rainbow Colorations of Cubes
- On heterochromatic out-directed spanning trees in tournaments
- Coloring the cube with rainbow cycles
- Hypercube 1-factorizations from extended Hamming codes
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Avoiding rainbow 2-connected subgraphs
This page was built for publication: Rainbows in the hypercube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879943)
