Let G be a properly edge-colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let 5 denote the minimum degree of G. We show that if Iv（G）I 〉 （σ2 ＋ 14σ ＋ 1）/4, then G...Let G be a properly edge-colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let 5 denote the minimum degree of G. We show that if Iv（G）I 〉 （σ2 ＋ 14σ ＋ 1）/4, then G has a rainbow matching of size 6, which answers a question asked by G. Wang [Electron. J. Combin., 2011, 18： #N162] affirmatively. In addition, we prove that if G is a properly colored bipartite graph with bipartition （X, Y） and max{lXl, IYI} 〉 （σ2 ＋ 4σ - 4）/4, then G has a rainbow matching of size σ.展开更多
Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to b...Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to be the color set of vertex u under f. If Cf(u) = Cf(v)for any two distinct vertices u and v of G, then f is called vertex-distinguishing total coloring of G(in brief VDTC), a vertex distinguishing total coloring using k colors is called k-vertexdistinguishing total coloring of G(in brief k-VDTC). The minimum number k for which there exists a k-vertex-distinguishing total coloring of G is called the vertex-distinguishing total chromatic number of G, denoted by χvt(G). By the method of prior distributing the color sets, we obtain vertex-distinguishing total chromatic number of m C9 in this paper.展开更多
文摘Let G be a properly edge-colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let 5 denote the minimum degree of G. We show that if Iv（G）I 〉 （σ2 ＋ 14σ ＋ 1）/4, then G has a rainbow matching of size 6, which answers a question asked by G. Wang [Electron. J. Combin., 2011, 18： #N162] affirmatively. In addition, we prove that if G is a properly colored bipartite graph with bipartition （X, Y） and max{lXl, IYI} 〉 （σ2 ＋ 4σ - 4）/4, then G has a rainbow matching of size σ.
基金Supported by the NNSF of China(Grant No.11761064,61163037)
文摘Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to be the color set of vertex u under f. If Cf(u) = Cf(v)for any two distinct vertices u and v of G, then f is called vertex-distinguishing total coloring of G(in brief VDTC), a vertex distinguishing total coloring using k colors is called k-vertexdistinguishing total coloring of G(in brief k-VDTC). The minimum number k for which there exists a k-vertex-distinguishing total coloring of G is called the vertex-distinguishing total chromatic number of G, denoted by χvt(G). By the method of prior distributing the color sets, we obtain vertex-distinguishing total chromatic number of m C9 in this paper.
