Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Zhishi Pan"'
Publikováno v:
Discrete Applied Mathematics. 313:135-146
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5c4ae8d94ce7379541309f0ed56dbd3
https://doi.org/10.1016/j.dam.2022.02.004
https://doi.org/10.1016/j.dam.2022.02.004
Publikováno v:
Graphs and Combinatorics. 37:1065-1082
The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c11e4b1396fc346cb09b29704cb9446
https://doi.org/10.1007/s00373-021-02305-w
https://doi.org/10.1007/s00373-021-02305-w
Autor:
Zhishi Pan, Xuding Zhu
Publikováno v:
Discrete Mathematics. 345:112733
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::62f399de887e814d1c948750c13c7af5
https://doi.org/10.1016/j.disc.2021.112733
https://doi.org/10.1016/j.disc.2021.112733
Publikováno v:
Journal of Graph Theory. 82:339-349
A graph G=V,E is antimagic if there is a one-to-one correspondence f:Ei¾?{1,2,...,|E|} such that for any two vertices u,v, i¾?e∈Eufei¾?i¾?e∈Evfe. It is known that bipartite regular graphs are antimagic and nonbipartite regular graphs of odd d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a830953bf8a9d7cb46673dbd9cfe77fc
https://doi.org/10.1002/jgt.21905
https://doi.org/10.1002/jgt.21905
Autor:
ZHISHI PAN1 zhishi@mail.tku.edu.tw, XUDING ZHU2,3 xudingzhu@gmail.com
Publikováno v:
SIAM Journal on Discrete Mathematics. 2010, Vol. 24 Issue 4, p1515-1526. 12p.
Autor:
Zhishi Pan1, Xuding Zhu1,2 zhu@math.nsysu.edu.tw
Publikováno v:
Graphs & Combinatorics. Mar2005, Vol. 21 Issue 1, p119-129. 11p.
Publikováno v:
Journal of Graph Theory. 67:178-197
Let S(r) denote a circle of circumference r. The circular consecutive choosability chcc(G) of a graph G is the least real number t such that for any r≥χc(G), if each vertex v is assigned a closed interval L(v) of length t on S(r), then there is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5171a0d3adc60a1e72ecbefed4adbfb
https://doi.org/10.1002/jgt.20524
https://doi.org/10.1002/jgt.20524
Autor:
Xuding Zhu, Zhishi Pan
Publikováno v:
Graphs and Combinatorics. 21:119-129
This paper completes the constructive proof of the following result: Suppose p/q?2 is a rational number, A is a finite set and f 1,f 2,···,f n are mappings from A to {0,1,···,p?1}. Then for any integer g, there is a graph G=(V,E) of girth at le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d98e044e1f73a0319926371675aa924
https://doi.org/10.1007/s00373-004-0596-6
https://doi.org/10.1007/s00373-004-0596-6
Autor:
Zhishi Pan, Xuding Zhu
Publikováno v:
Journal of Graph Theory. 46:57-68
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::070de7e871e87ecfae9bbf6761eab9c5
https://doi.org/10.1002/jgt.10171
https://doi.org/10.1002/jgt.10171
Autor:
Zhishi Pan, Xuding Zhu
Publikováno v:
Journal of Graph Theory. 43:304-318
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a7dd790b428201f509dfc9f3b8fa34c
https://doi.org/10.1002/jgt.10124
https://doi.org/10.1002/jgt.10124