Donghan Zhang

Dr. Donghan Zhang


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 June 2020 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
DZDonghan Zhang
Donghan Zhang
YLYou Lu
You Lu
SZShenggui Zhang
Shenggui Zhang

30 December 2020 in Acta Mathematica Sinica, English Series
Verified
Journal Article
Closed access
PDF file
DZDonghan Zhang
Donghan Zhang
YLYou Lu
You Lu
SZShenggui Zhang
Shenggui Zhang

25 March 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
DZDonghan Zhang
Donghan Zhang
A theta graph Θ2,1,2 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 ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each edge uv∈E(G), where EG(u) 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 (Δ+3)-coloring. In this paper, we show that the listing version of this conjecture holds for any IC-planar graph with maximum degree Δ≥9 but without theta graphs Θ2,1,2 by applying the Combinatorial Nullstellensatz, which improves the result of Song et al.

26 September 2021 in Symmetry
Verified
Journal Article
Open access
PDF file
DZDonghan Zhang
Donghan Zhang
CLChao Li
Chao Li
FCFugang Chao
Fugang Chao
A proper total k-coloring ϕ of G with ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(z) for each uv∈E(G) is called a total neighbor sum distinguishing k-coloring, where EG(u)={uv|uv∈E(G)}. Pilśniak and Woźniak conjectured that every graph with maximum degree Δ exists a total neighbor sum distinguishing (Δ+3)-coloring. In this paper, we proved that any IC-planar graph with Δ≥12 satisfies this conjecture, which improves the result of Song and Xu.

18 August 2021 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
DZDonghan Zhang
Donghan Zhang
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.

15 November 2021 in Czechoslovak Mathematical Journal
Verified
Journal Article
Closed access
DZDonghan Zhang
Donghan Zhang
Institute of Mathematics of the Czech Academy of Sciences