1 citations · 2 across the 6 of their papers we have counts for
6 papers · 1 filter
Conflict-free connection of trees
Hong Chang, Meng Ji, Xueliang Li +1
We study the conflict-free connection coloring of trees, which is also the conflict-free coloring of the so-called edge-path hypergraphs of trees. We first prove that for a tree $T…
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Wenjing Li, Xueliang Li, Colton Magnant +1
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…
Nordhaus-Gaddum-type theorem for total proper connection number of graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A path in a total-colored graph is called a \emph{total-proper path}…
3-Rainbow index and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A tree in an edge-colored connected graph is called \emph{a rainbow tree} if no two edges of it are assigned the same color. For a vertex subset , a tree is ca…
The -proper index of complete bipartite and complete multipartite graphs
Wenjing Li, Xueliang Li, Jingshu Zhang
Let be a nontrivial connected graph of order with an edge-coloring ,, where adjacent edges may be colored with the same co…
Rainbow vertex-connection and forbidden subgraphs
Wenjing Li, Xueliang Li, Jingshu Zhang
A path in a vertex-colored graph is called \emph{vertex-rainbow} if its internal vertices have pairwise distinct colors. A graph is \emph{rainbow vertex-connected} if for any t…