Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
From MaRDI portal
Publication:2811196
DOI10.1002/JGT.21888zbMATH Open1338.05176OpenAlexW2126036367MaRDI QIDQ2811196FDOQ2811196
Sogol Jahanbekam, Douglas B. West
Publication date: 10 June 2016
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21888
Recommendations
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Anti-Ramsey number of edge-disjoint rainbow spanning trees
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Edge-disjoint rainbow spanning trees in complete graphs
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)
Cites Work
- On Hamilton's ideals
- Edge-Disjoint Spanning Trees of Finite Graphs
- On Representatives of Subsets
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Edge-colorings of complete graphs that avoid polychromatic trees
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- Rainbow generalizations of Ramsey theory: A survey
- The anti-Ramsey number of perfect matching
- Edge-disjoint rainbow spanning trees in complete graphs
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Rainbow edge-coloring and rainbow domination
- Complete solution for the rainbow numbers of matchings
- On rainbow cycles in edge colored complete graphs
- On the anti-Ramsey numbers for spanning trees
Cited In (19)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
- Anti-Ramsey number of matchings in outerplanar graphs
- Anti-Ramsey numbers of subdivided graphs
- Title not available (Why is that?)
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- Rainbow matchings in an edge-colored planar bipartite graph
- Anti-Ramsey problems for cycles
- Anti-Ramsey number of triangles in complete multipartite graphs
- Rainbow triangles in edge-colored Kneser graphs
- Anti-Ramsey numbers of spanning double stars
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
- Anti-Ramsey number of matchings in a hypergraph
- Balanced edge-colorings avoiding rainbow cliques of size four
This page was built for publication: Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811196)
