Donghan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Donghan Zhang has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Shenggui Zhang
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, P. R. China
2 shared publications - You Lu
School of Mathematics and Statistics, Northwestern Polytechnical University, Xi’an, P. R. China
2 shared publications - Chao Li
Institute of Applied Mathematics, Shangluo University, Shangluo, China
1 shared publication - Fugang Chao
School of Mathematics and Computer Application, Shangluo University, Shangluo 726000, China
1 shared publication
Latest Publications
- 15 November 2021
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (1) , 1-14
Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
Institute of Mathematics of the Czech Academy of Sciences
- 15 November 2021
- Published by Institute of Mathematics, Czech Academy of Sciences in Czechoslovak Mathematical Journal
- Vol. 72 (1) , 1-14
Neighbor sum distinguishing list total coloring of IC-planar graphs without 5-cycles
Institute of Mathematics of the Czech Academy of Sciences
- Open Access
On the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs
A proper total k-coloring of G with for each is called a total neighbor sum distinguishing k-coloring, where . Pilśniak and Woźniak conjectured that every graph with maximum degree exists a total neighbor sum distinguishing -coloring. In this paper, we proved that any IC-planar graph with satisfies this conjecture, which improves the result of Song and Xu.Open AccessOn the Total Neighbor Sum Distinguishing Index of IC-Planar Graphs
A proper total k-coloring of G with for each is called a total neighbor sum distinguishing k-coloring, where . Pilśniak and Woźniak conjectured that every graph with maximum degree exists a total neighbor sum distinguishing -coloring. In this paper, we proved that any IC-planar graph with satisfies this conjecture, which improves the result of Song and Xu. - 18 August 2021
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 24 (6) , 1845-1856
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
A NIC-planar graph is a graph that has a drawing in the plane such that each edge is crossed at most once and any two pairs of crossing edges share at most one common vertex. Let EG (u) denote the set of edges incident with a vertex u. A neighbor sum distinguishing (NSD) total coloring ϕ of G is a proper total coloring of G such that for each edge uυ ∈E(G) . Pilśniak and Woźniak conjectured that any graph with maximum degree Δ admits an NSD total (Δ+ 3) -coloring. In this paper, we prove that the list version of the conjecture holds for any triangle-free NIC-planar graph with Δ ≥ 8 and with each vertex incident with at most two crossing edges by applying the Combinatorial Nullstellensatz.
- 18 August 2021
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 24 (6) , 1845-1856
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions
A NIC-planar graph is a graph that has a drawing in the plane such that each edge is crossed at most once and any two pairs of crossing edges share at most one common vertex. Let EG (u) denote the set of edges incident with a vertex u. A neighbor sum distinguishing (NSD) total coloring ϕ of G is a proper total coloring of G such that for each edge uυ ∈E(G) . Pilśniak and Woźniak conjectured that any graph with maximum degree Δ admits an NSD total (Δ+ 3) -coloring. In this paper, we prove that the list version of the conjecture holds for any triangle-free NIC-planar graph with Δ ≥ 8 and with each vertex incident with at most two crossing edges by applying the Combinatorial Nullstellensatz.
- Open Access
- 25 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (7) , 708
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ2,1,2
A theta graph is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring of G is a proper total coloring of G such that for each edge , where denotes the set of edges incident with a vertex u. In 2015, Pilśniak and Woźniak introduced this coloring and conjectured that every graph with maximum degree admits an NSD total -coloring. In this paper, we show that the listing version of this conjecture holds for any IC-planar graph with maximum degree but without theta graphs by applying the Combinatorial Nullstellensatz, which improves the result of Song et al.- 25 March 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (7) , 708
Open AccessNeighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ2,1,2
A theta graph is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring of G is a proper total coloring of G such that for each edge , where denotes the set of edges incident with a vertex u. In 2015, Pilśniak and Woźniak introduced this coloring and conjectured that every graph with maximum degree admits an NSD total -coloring. In this paper, we show that the listing version of this conjecture holds for any IC-planar graph with maximum degree but without theta graphs by applying the Combinatorial Nullstellensatz, which improves the result of Song et al. - 30 December 2020
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 36 (12) , 1417-1428
Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles
- 30 December 2020
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 36 (12) , 1417-1428
Neighbor Sum Distinguishing Total Choice Number of Planar Graphs without 6-cycles
- 2 June 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 36 (5) , 1545-1562
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs
- 2 June 2020
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 36 (5) , 1545-1562
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs