Local rainbow colorings for various graphs
From MaRDI portal
Publication:6574396
DOI10.37236/11911zbMATH Open1543.0505MaRDI QIDQ6574396
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local rainbow colorings
- Rainbow Turán problems for paths and forests of stars
- Anti-Ramsey numbers of subdivided graphs
- Rainbow Turán problem for even cycles
- On the anti-Ramsey numbers of linear forests
- A proof of Ringel's conjecture
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- The probabilistic method
- Anti-Ramsey numbers of small graphs.
- Rainbow Turán Problems
- On a rainbow extremal problem for color‐critical graphs
- Rainbow clique subdivisions
This page was built for publication: Local rainbow colorings for various graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574396)
