Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees

DOI10.1002/JGT.21888MaRDI QIDQ2811196zbMATH OpenOpenAlexFDO

Authors 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

rainbowHamiltonian cycleperfect matchingspanning subgraphspanning treeanti-Ramsey number

Mathematics Subject Classification ID

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

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

Cites work

• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• An anti-Ramsey theorem on cycles
• Complete solution for the rainbow numbers of matchings
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-colorings of complete graphs that avoid polychromatic trees
• Edge-disjoint rainbow spanning trees in complete graphs
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs
• On Hamilton's ideals
• On Representatives of Subsets
• On rainbow cycles in edge colored complete graphs
• On the anti-Ramsey numbers for spanning trees
• Rainbow edge-coloring and rainbow domination
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow numbers for matchings and complete graphs
• The anti-Ramsey number of perfect matching

Cited in

(23)

• Balanced edge-colorings avoiding rainbow cliques of size four
• Anti-Ramsey number of matchings in outerplanar graphs
• Anti-Ramsey numbers of subdivided graphs
• Rainbow disjoint union of clique and matching in edge-colored complete graph
• scientific article; zbMATH DE number 5995288 (Why is no real title available?)
• 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 edge-disjoint rainbow spanning trees
• Anti-Ramsey number of triangles in complete multipartite graphs
• Rainbow triangles in edge-colored Kneser graphs
• Monochromatic spanning trees and matchings in ordered complete graphs
• Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Anti-Ramsey numbers of spanning double stars
• 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 union of 5-path and matching
• Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
• Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
• Rainbow forest consisting of short paths in K_n
• Anti-Ramsey number of matchings in a hypergraph

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)