Rainbow Numbers for Cycles in Plane Triangulations
From MaRDI portal
Publication:4982286
DOI10.1002/jgt.21803zbMath1309.05107OpenAlexW1909181702WikidataQ114236175 ScholiaQ114236175MaRDI QIDQ4982286
Mirko Horňák, Roman Soták, Stanlislav Jendroľ, Ingo Schiermeyer
Publication date: 24 March 2015
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.21803
Related Items (22)
Improved bounds for rainbow numbers of matchings in plane triangulations ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Rainbow number of matchings in planar graphs ⋮ Exact rainbow numbers for matchings in plane triangulations ⋮ Planar anti-Ramsey numbers of matchings ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Planar Turán numbers of cubic graphs and disjoint union of cycles ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ Anti-Ramsey number of matchings in a hypergraph ⋮ The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs ⋮ Rainbow numbers for paths in planar graphs ⋮ Rainbow matchings in edge-colored complete split graphs ⋮ Anti-Ramsey problems for cycles ⋮ Rainbow triangles in edge-colored Kneser graphs ⋮ Rainbow numbers for small graphs in planar graphs ⋮ Anti-Ramsey number of triangles in complete multipartite graphs ⋮ Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs ⋮ Planar anti-Ramsey numbers of paths and cycles ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ Extremal Theta-free planar graphs ⋮ On rainbow matchings in plane triangulations
Cites Work
This page was built for publication: Rainbow Numbers for Cycles in Plane Triangulations
