Rainbow disjoint union of P₄ and a matching in complete graphs

DOI10.1016/j.amc.2024.128679MaRDI QIDQ6585524zbMATH OpenFDO

Authors Zemin Jin, Qing Jie, Zhenxin Cao

Publication date 12 August 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2024.128679

zbMATH Keywords

anti-Ramsey numberdisjoint union of graphsrainbow graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Rainbow short linear forests in edge-colored complete graph
• Anti-Ramsey numbers for disjoint copies of graphs
• The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
• Anti-Ramsey numbers for vertex-disjoint triangles

Cites work

• Anti-Ramsey coloring for matchings in complete bipartite graphs
• Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs
• Anti-Ramsey number of matchings in a hypergraph
• Anti-Ramsey number of matchings in hypergraphs
• Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
• Anti-Ramsey numbers of graphs with small connected components
• Anti-Ramsey numbers of small graphs.
• Anti-Ramsey problems for t edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
• Anti-Ramsey problems in complete bipartite graphs for t edge-disjoint rainbow spanning subgraphs: cycles and matchings
• Bipartite rainbow numbers of matchings
• Complete solution for the rainbow numbers of matchings
• Exact rainbow numbers for matchings in plane triangulations
• Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• Improved bounds for rainbow numbers of matchings in plane triangulations
• On the anti-Ramsey number of forests
• On the anti-Ramsey numbers of linear forests
• Planar anti-Ramsey numbers of matchings
• Rainbow matchings in edge-colored complete split graphs
• Rainbow number of matchings in planar graphs
• Rainbow numbers for matchings and complete graphs
• Rainbow numbers for matchings in plane triangulations
• The anti-Ramsey number of perfect matching
• The rainbow number of matchings in regular bipartite graphs
• Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman

Cited in

(5)

• Rainbow short linear forests in edge-colored complete graph
• Anti-Ramsey number of union of 5-path and matching
• Rainbow forest consisting of short paths in K_n
• Rainbow-free colorings for spanning linear forest consisting of short paths
• On the anti-Ramsey number under edge deletion

This page was built for publication: Rainbow disjoint union of \(P_4\) and a matching in complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585524)