%0 Journal Article
%T 一类平面图中的彩虹匹配<br>Rainbow Matchings in Planar Graphs
%A 余锐
%A 王华平
%J Advances in Applied Mathematics
%P 238-245
%@ 2324-8009
%D 2022
%I Hans Publishing
%R 10.12677/AAM.2022.111030
%X 对给定的边染色图 G，若图 G 的每条边的颜色都不同，则G是彩虹的。对给定的图 G 和 H，H 在G 上的 anti-Ramsey 数，记作 AR(G, H)，表示图 G 中不包含任何同构千 H 的彩虹子图的最大边染色数。本文主要研究T<span style=\"text-decoration:overline;\"><sub>n</sub></span>中匹配的 anti-Ramsey 数。<br />
We call an edge-colored graph G rainbow, if all of its edges have different colors. The anti-Ramsey number of the graph H in G, denoted by AR(G, H), is the maximum number of colors in an edge-coloring of G which does not contain any rainbow subgraph isomorphic to H. In this paper, we consider the anti-Ramsey number for matchings in  planar  graphs T<span style=\"text-decoration:overline;\"><sub>n</sub></span>.
%K 匹配，彩虹图，Anti-Ramsey数<br>Matching
%K Rainbow Graph
%K Anti-Ramsey Number
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=48128