Local rainbow colorings for various graphs
From MaRDI portal
Publication:6574396
DOI10.37236/11911zbMATH Open1543.0505MaRDI QIDQ6574396FDOQ6574396
Authors: Xinbu Cheng, Zixiang Xu 
Publication date: 18 July 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- The probabilistic method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anti-Ramsey numbers of small graphs.
- Rainbow Turán Problems
- Title not available (Why is that?)
- Local rainbow colorings
- Anti-Ramsey numbers of subdivided graphs
- Rainbow Turán problem for even cycles
- Rainbow Turán problems for paths and forests of stars
- On the anti-Ramsey numbers of linear forests
- Title not available (Why is that?)
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- A proof of Ringel's conjecture
- 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)
