Edge-colorings with no large polychromatic stars
From MaRDI portal
Publication:1606032
DOI10.1007/s003730200022zbMath0991.05044OpenAlexW2018330896MaRDI QIDQ1606032
Publication date: 29 July 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200022
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)
Related Items (36)
Bipartite anti-Ramsey numbers of cycles ⋮ Anti-Ramsey numbers in complete split graphs ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Anti-Ramsey Hypergraph Numbers ⋮ On \(\mathrm{M}_f\)-edge colorings of graphs ⋮ Improved approximation for maximum edge colouring problem ⋮ Approximation and hardness results for the maximum edge \(q\)-coloring problem ⋮ On the anti-Ramsey number of forests ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ An anti-Ramsey theorem on diamonds ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Extremal coloring for the anti-Ramsey problem of matchings in complete graphs ⋮ Anti-Ramsey numbers for matchings in regular bipartite graphs ⋮ Anti-Ramsey problems in the Mycielskian of a cycle ⋮ Totally Multicolored diamonds ⋮ Anti-Ramsey number of matchings in outerplanar graphs ⋮ New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring ⋮ Edge-colorings of complete graphs that avoid polychromatic trees ⋮ Maximum face-constrained coloring of plane graphs ⋮ On maximum face-constrained coloring of plane graphs with no short face cycles. ⋮ Anti-Ramsey numbers for matchings in 3-regular bipartite 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 matchings in edge-colored complete split graphs ⋮ Anti-Ramsey coloring for matchings in complete bipartite graphs ⋮ Anti-Ramsey numbers in complete \(k\)-partite graphs ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ On the maximal colorings of complete graphs without some small properly colored subgraphs ⋮ Complexity of Computing the Anti-Ramsey Numbers for Paths. ⋮ Complete solution for the rainbow numbers of matchings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Anti-Ramsey numbers for cycles in \(n\)-prisms ⋮ Anti-Ramsey numbers for vertex-disjoint triangles ⋮ Rainbow numbers for certain graphs
This page was built for publication: Edge-colorings with no large polychromatic stars
