Anti-Ramsey numbers in complete k-partite graphs
From MaRDI portal
Publication:2007338
DOI10.1155/2020/5136104zbMATH Open1459.05198OpenAlexW3083432311MaRDI QIDQ2007338FDOQ2007338
Jili Ding, Haizheng Yu, Hong Bian
Publication date: 13 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/5136104
Recommendations
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Anti-Ramsey number of triangles in complete multipartite graphs
- Edge-colorings of complete bipartite graphs without large rainbow trees
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Bipartite rainbow numbers of matchings
- Edge-colorings with no large polychromatic stars
- An anti-Ramsey theorem on cycles
- Bipartite anti-Ramsey numbers of cycles
- Rainbow numbers for matchings in plane triangulations
- Title not available (Why is that?)
- The anti-Ramsey number of perfect matching
- Rainbows in the hypercube
- Complete solution for the rainbow numbers of matchings
- Anti-Ramsey numbers for graphs with independent cycles
- Title not available (Why is that?)
- Planar anti-Ramsey numbers of paths and cycles
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- On the anti-Ramsey numbers for spanning trees
Cited In (11)
- Anti-Ramsey numbers of doubly edge-critical graphs
- Title not available (Why is that?)
- Computing the anti-Ramsey number for trees in complete tripartite graph
- On the anti-Ramsey numbers for spanning trees
- On a generalized anti-Ramsey problem
- Anti-Ramsey number of triangles in complete multipartite graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs
- Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs
This page was built for publication: Anti-Ramsey numbers in complete \(k\)-partite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007338)
