Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees

DOI10.1002/jgt.21888zbMath1338.05176OpenAlexW2126036367MaRDI QIDQ2811196

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

zbMATH Keywords

rainbowspanning treeHamiltonian cycleperfect matchingspanning subgraphanti-Ramsey number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Related Items (13)

Rainbow spanning subgraphs of small diameter in edge-colored complete graphs ⋮ Rainbow matchings in an edge-colored planar bipartite graph ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees ⋮ 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 of matchings in outerplanar graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Anti-Ramsey problems for cycles ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings

Cites Work

• Edge-disjoint rainbow spanning trees in complete graphs
• Rainbow edge-coloring and rainbow domination
• Rainbow generalizations of Ramsey theory: A survey
• The anti-Ramsey number of perfect matching
• Complete solution for the rainbow numbers of matchings
• 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
• On Hamilton's ideals
• An anti-Ramsey theorem on cycles
• Edge-Disjoint Spanning Trees of Finite Graphs
• On Representatives of Subsets
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees