The following pages link to Jingshu Zhang (Q681263):
Displaying 8 items.
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Rainbow vertex-connection and forbidden subgraphs (Q1692637) (← links)
- Nordhaus-Gaddum-type theorem for total-proper connection number of graphs (Q1712789) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- 3-rainbow index and forbidden subgraphs (Q2409535) (← links)
- The $k$-proper index of complete bipartite and complete multipartite graphs (Q4595232) (← links)
- A sharp upper bound on the cycle isolation number of graphs (Q6083190) (← links)