Anti-Ramsey number of matchings in outerplanar graphs
From MaRDI portal
Publication:6145814
DOI10.1016/j.dam.2023.11.049zbMath1530.05123MaRDI QIDQ6145814
No author found.
Publication date: 9 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Anti-Ramsey number of matchings in hypergraphs
- Rainbow numbers for matchings in plane triangulations
- Rainbow generalizations of Ramsey theory: A survey
- The rainbow number of matchings in regular bipartite graphs
- The anti-Ramsey number of perfect matching
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Bipartite rainbow numbers of matchings
- Complete solution for the rainbow numbers of matchings
- Matching theory
- Edge-colorings with no large polychromatic stars
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow number of matchings in planar graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Rainbow matchings in edge-colored complete split graphs
- Anti-Ramsey numbers of subdivided graphs
- Rainbow numbers for matchings and complete graphs
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
- Rainbow matchings in an edge-colored planar bipartite graph
- Anti-Ramsey number of matchings in a hypergraph
- Rainbow numbers for small graphs in planar graphs
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Planar anti-Ramsey numbers of matchings
- An anti-Ramsey theorem on cycles
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- On the anti-Ramsey number of forests
- Exact rainbow numbers for matchings in plane triangulations
- Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees
- Bipartite anti-Ramsey numbers of cycles
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Rainbow Numbers for Cycles in Plane Triangulations
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- An anti-Ramsey theorem
This page was built for publication: Anti-Ramsey number of matchings in outerplanar graphs
