# Search results for: Zemin Jin

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 245-261

Applied Mathematics and Computation > 2017 > 311 > C > 223-227

Applied Mathematics and Computation > 2017 > 308 > C > 90-95

_{c}(G). In this paper, we studied the coupon coloring...

Discrete Mathematics > 2017 > 340 > 6 > 1191-1202

Journal of Combinatorial Optimization > 2017 > 34 > 4 > 1012-1028

*G*, the anti-Ramsey number $$AR(K_n,G)$$ A R ( K n , G ) is defined to be the maximum number of colors in an edge-coloring of $$K_n$$ K n which does not contain any rainbow

*G*(i.e., all the edges of

*G*have distinct colors). The anti-Ramsey number was introduced by Erdős et al. (Infinite and finite sets, pp 657–665, 1973) and so far it has been determined for several...

Applied Mathematics and Computation > 2017 > 292 > C > 114-119

_{n}, H) was introduced by Erdős, Simonovits and Sós in 1973, which is defined to be the maximum number of colors in an edge coloring of the complete graph K

_{n}without any rainbow H. Later, the anti-Ramsey numbers for several special graph classes in complete are determined. Moreover, researchers generalized the host graph K

_{n}to other graphs, in particular, to complete bipartite...

Discrete Applied Mathematics > 2016 > 200 > C > 186-190

Journal of Combinatorial Optimization > 2017 > 33 > 1 > 1-12

*AR*(

*G*,

*H*) is defined to be the maximum number of colors in an edge coloring of

*G*which doesn’t contain any rainbow subgraphs isomorphic to

*H*. It is clear that there is an $$AR(K_{m,n},kK_2)$$ A R ( K m , n , k K 2 ) -edge-coloring of $$K_{m,n}$$ K m , n that doesn’t contain any rainbow $$kK_2$$ k K 2 . In this paper, we show the uniqueness...

Journal of Combinatorial Optimization > 2014 > 28 > 2 > 321-340

*heterochromatic tree partition number*of an $$r$$ -edge-colored graph $$G,$$ denoted by $$t_r(G),$$ is the minimum positive integer $$p$$ such that whenever the edges of the graph $$G$$ are colored with $$r$$ colors, the vertices of $$G$$ can be covered by at most $$p$$ vertex disjoint heterochromatic trees. In this article we determine the upper and lower...

Discrete Mathematics > 2012 > 312 > 4 > 789-802

Discrete Mathematics > 2009 > 309 > 8 > 2575-2578

Discrete Mathematics > 2008 > 308 > 23 > 5864-5870

Discrete Mathematics > 2008 > 308 > 17 > 3871-3878

Discrete Applied Mathematics > 2007 > 155 > 10 > 1267-1274

Theoretical Computer Science > 2006 > 355 > 3 > 354-363

Graphs and Combinatorics > 2006 > 22 > 3 > 361-370

*k*≥4, every

*k*-connected graph contains two triangles sharing an edge, or admits a

*k*-contractible edge, or admits a

*k*-contractible triangle. This implies Thomassen's result that every triangle-free

*k*-connected graph contains a

*k*-contractible edge. In this paper, we extend Kawarabayashi's technique and prove a more general result concerning

*k*-contractible cliques.

Journal of Combinatorial Optimization > 2006 > 11 > 4 > 445-454

*NP*-complete...