1 citations · 1 across the 4 of their papers we have counts for
4 papers
On Neutral Edge Sets in Anti-Ramsey Numbers
Ali Ghalavand, Qing Jie, Zemin Jin +2
The anti-Ramsey number of a graph , introduced by Erdős et al.\ in 1975, is the maximum number of colors in an edge-coloring of the complete graph that avoids a rainbow co…
On the Anti-Ramsey Number Under Edge Deletion
Ali Ghalavand, Qing Jie, Zemin Jin +2
According to a study by Erdős et al. in 1975, the anti-Ramsey number of a graph \(G\), denoted as \(AR(n, G)\), is defined as the maximum number of colors that can be used in an ed…
Partitioning complete graphs by heterochromatic trees
Zemin Jin, Xueliang Li
A {\it heterochromatic tree} is an edge-colored tree in which any two edges have different colors. The {\it heterochromatic tree partition number} of an -edge-colored graph ,…
Heterochromatic tree partition number of a complete multipartite graph
He Chen, Zemin Jin, Xueliang Li +1
This paper has been withdrawn by the author(s), due an error in the proof.