The rainbow numbers of cycles in maximal bipartite planar graph
From MaRDI portal
Publication:6585243
DOI10.1016/J.DAM.2024.05.006zbMATH Open1548.05135MaRDI QIDQ6585243
Changqing Xu, Lei Ren, Yongxin Lan
Publication date: 9 August 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anti-Ramsey numbers in complete split graphs
- Rainbow numbers for cycles with pendant edges
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Planar anti-Ramsey numbers of paths and cycles
- An anti-Ramsey theorem on cycles
- 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
This page was built for publication: The rainbow numbers of cycles in maximal bipartite planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585243)
