Anti-Ramsey numbers of subdivided graphs
From MaRDI portal
Publication:1850619
DOI10.1006/jctb.2001.2105zbMath1019.05047OpenAlexW1966455700MaRDI QIDQ1850619
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2001.2105
Related Items (22)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Improved approximation for maximum edge colouring problem ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Planar anti-Ramsey numbers of matchings ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ Anti-Ramsey numbers of doubly edge-critical graphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ On rainbow matchings in plane triangulations ⋮ Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings ⋮ Rainbow numbers for certain graphs
Cites Work
- On restricted colourings of \(K_ n\)
- Edge-colorings of complete graphs that avoid polychromatic trees
- New upper bounds for a canonical Ramsey problem
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- Subdivided graphs have linear ramsey numbers
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Anti-Ramsey numbers of subdivided graphs
