Rainbow numbers for matchings in plane triangulations
DOI10.1016/J.DISC.2014.05.012zbMATH Open1297.05191OpenAlexW2047233111MaRDI QIDQ397167FDOQ397167
Jianhua Tu, Stanislav Jendroľ, Ingo Schiermeyer
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.05.012
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Rainbow numbers for matchings and complete graphs
- Title not available (Why is that?)
- Rainbow generalizations of Ramsey theory: A survey
- Complete solution for the rainbow numbers of matchings
- Title not available (Why is that?)
Cited In (27)
- Planar anti-Ramsey numbers of matchings
- Anti-Ramsey number of matchings in outerplanar graphs
- Anti-Ramsey numbers in complete split graphs
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Anti-Ramsey numbers in complete \(k\)-partite graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey number of Hanoi graphs
- Rainbow numbers for paths in planar graphs
- Schur numbers involving rainbow colorings
- Rainbow numbers for small graphs in planar graphs
- Rainbow matchings in an edge-colored planar bipartite graph
- Anti-Ramsey problems for cycles
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Rainbow numbers for matchings and complete graphs
- Rainbow triangles in edge-colored Kneser graphs
- On rainbow matchings in plane triangulations
- Rainbow number of matchings in planar graphs
- Rainbow matchings in edge-colored complete split graphs
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Anti-Ramsey numbers for cycles in \(n\)-prisms
- Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
- Exact rainbow numbers for matchings in plane triangulations
- Anti-Ramsey number of matchings in a hypergraph
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
Recommendations
This page was built for publication: Rainbow numbers for matchings in plane triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397167)
