On the rainbow planar Turán number of double stars
From MaRDI portal
Publication:6611065
DOI10.1016/J.DAM.2024.07.004zbMATH Open1547.05136MaRDI QIDQ6611065
Publication date: 26 September 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Rainbow Turán problems for paths and forests of stars
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy
- Extremal \(H\)-free planar graphs
- The maximum number of paths of length four in a planar graph
- Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles
- Rainbow Turán Problems
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow cycles vs. rainbow paths
- Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees
This page was built for publication: On the rainbow planar Turán number of double stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6611065)