Anti-Ramsey numbers in complete k-partite graphs
DOI10.1155/2020/5136104zbMATH Open1459.05198OpenAlexW3083432311MaRDI QIDQ2007338FDOQ2007338
Authors: Jili Ding, Hong Bian, Haizheng Yu 
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
- Edge-colorings of complete bipartite graphs without large rainbow trees
- 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 (27)
- Anti-Ramsey numbers of doubly edge-critical graphs
- Anti-Ramsey number of matchings in outerplanar graphs
- Edge-colorings of complete bipartite graphs without large rainbow trees
- Title not available (Why is that?)
- Anti-Ramsey numbers in complete split graphs
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Anti-Ramsey number of Hanoi graphs
- Computing the anti-Ramsey number for trees in complete tripartite graph
- Anti-Ramsey numbers of graphs with small connected components
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- On the anti-Ramsey numbers for spanning trees
- Anti-Ramsey numbers of minimal graphs
- On a generalized anti-Ramsey problem
- Anti-Ramsey number of triangles in complete multipartite graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Anti-Ramsey numbers for trees in complete multi-partite graphs
- Rainbow matchings in edge-colored complete split 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
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey numbers for cycles in the generalized Petersen graphs
- Anti-Ramsey hypergraph numbers
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-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)
