Rainbow subgraphs in edge-colored planar and outerplanar graphs
From MaRDI portal
Publication:6063835
DOI10.47443/dml.2023.048OpenAlexW4381804290MaRDI QIDQ6063835
Publication date: 12 December 2023
Published in: Discrete Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.47443/dml.2023.048
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Interior graphs of maximal outerplane graphs
- Characterizations of outerplanar graphs
- A variant of the classical Ramsey problem
- On edge colorings with at least \(q\) colors in every subset of \(p\) vertices
- On generalized Ramsey theory: The bipartite case
- Generalized Ramsey numbers: forbidding paths with few colors
- Local properties in colored graphs, distinct distances, and difference sets
- The Erdős-Gyárfás problem on generalized Ramsey numbers
- Every planar map is four colorable
- An application of the regularity lemma in generalized Ramsey theory
- Maximal antiramsey graphs and the strong chromatic number
- Color Isomorphic Even Cycles and a Related Ramsey Problem
- Local Properties via Color Energy Graphs and Forbidden Configurations
- On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
