Complete graphs with no rainbow path
From MaRDI portal
Recommendations
Cited in
(27)- On \((t-1)\)-colored paths in \(t\)-colored complete graphs
- Ramsey and Gallai-Ramsey numbers for the union of paths and stars
- Gallai-Ramsey numbers for rainbow P₅ and monochromatic fans or wheels
- Gallai-Ramsey numbers for rainbow paths
- Symbolic coloured SCC decomposition
- Complete graphs and complete bipartite graphs without rainbow path
- Extensions of Gallai-Ramsey results
- scientific article; zbMATH DE number 5995288 (Why is no real title available?)
- Rainbow faces in edge-colored plane graphs
- scientific article; zbMATH DE number 7566051 (Why is no real title available?)
- Complete graphs with no rainbow tree
- Constrained Ramsey numbers
- Gallai-Ramsey numbers involving a rainbow 4-path
- Complete bipartite graphs without small rainbow stars
- Balanced edge-colorings avoiding rainbow cliques of size four
- Complete bipartite graphs without small rainbow subgraphs
- Properly edge-coloured subgraphs in colourings of bounded degree
- Gallai-Ramsey multiplicity for rainbow small trees
- Gallai-Ramsey numbers for paths
- Ramsey and Gallai-Ramsey numbers for comb and sun graphs
- Preorder induced by rainbow forbidden subgraphs
- Ramsey and Gallai-Ramsey numbers for multiple triangles of graphs and their multiplicities
- Ramsey and Gallai-Ramsey numbers for forests
- Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs
- Ramsey and Gallai-Ramsey numbers of cycles and books
- Gallai-Ramsey numbers for rainbow trees and monochromatic double stars or books
- Pattern avoidance on graphs
This page was built for publication: Complete graphs with no rainbow path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3427376)