default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuding Zhu
朱緒鼎
Person information
- unicode name: 朱緒鼎
- affiliation: Zhejiang Normal University, China
- affiliation: National Sun Yat-sen University, Kaohsiung, Department of Applied Mathematics
- affiliation: Simon Fraser University, Burnaby, School of Computing Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j261]Masaki Kashima, Xuding Zhu:
Odd 4-Coloring of Outerplanar Graphs. Graphs Comb. 40(6): 108 (2024)- [j260]Yangyan Gu, Xuding Zhu
:
The Alon-Tarsi number of planar graphs revisited. J. Graph Theory 105(3): 398-402 (2024) - 2023
- [j259]Ming Han, Tao Wang, Jianglin Wu, Huan Zhou, Xuding Zhu:
Weak Degeneracy of Planar Graphs and Locally Planar Graphs. Electron. J. Comb. 30(4) (2023) - [j258]Ming Han, Xuding Zhu:
Weak (2,3)-Decomposition of Planar Graphs. Electron. J. Comb. 30(4) (2023) - [j257]Lingxi Li, Huajing Lu, Tao Wang, Xuding Zhu:
Decomposition of planar graphs with forbidden configurations. Discret. Appl. Math. 331: 147-158 (2023) - [j256]Jialu Zhu, Xuding Zhu:
The circular chromatic number of signed series-parallel graphs of given girth. Discret. Appl. Math. 341: 82-92 (2023) - [j255]Douglas B. West, Xuding Zhu:
2-Reconstructibility of Strongly Regular Graphs and 2-Partially Distance-Regular Graphs. Graphs Comb. 39(5): 94 (2023) - [j254]Xuding Zhu:
List 4-colouring of planar graphs. J. Comb. Theory B 162: 1-12 (2023) - [j253]Rongxing Xu, Xuding Zhu:
The strong fractional choice number of 3-choice-critical graphs. J. Graph Theory 102(2): 346-373 (2023) - [j252]Yangyan Gu, Xuding Zhu:
Girth and λ $\lambda $-choosability of graphs. J. Graph Theory 103(3): 493-501 (2023) - [j251]Jialu Zhu, Xuding Zhu:
Bad list assignments for non-k $k$-choosable k $k$-chromatic graphs with 2k+2 $2k+2$-vertices. J. Graph Theory 104(4): 712-726 (2023) - [j250]Yangyan Gu, Yiting Jiang, David R. Wood, Xuding Zhu:
Refined List Version of Hadwiger's Conjecture. SIAM J. Discret. Math. 37(3): 1738-1750 (2023) - 2022
- [j249]Huajing Lu, Xuding Zhu:
Dense Eulerian Graphs are $(1, 3)$-Choosable. Electron. J. Comb. 29(2) (2022) - [j248]Jialu Zhu, Xuding Zhu:
The Fractional Chromatic Number of Generalized Cones over Graphs. Electron. J. Comb. 29(2) (2022) - [j247]Zhishi Pan, Xuding Zhu:
The circular chromatic numbers of signed series-parallel graphs. Discret. Math. 345(3): 112733 (2022) - [j246]Yangyan Gu, Hao Qi, Yeong-Nan Yeh, Xuding Zhu:
Generalized signed graphs of large girth and large chromatic number. Discret. Math. 345(10): 112980 (2022) - [j245]Yangyan Gu, Xuding Zhu:
Signed planar graphs with given circular chromatic numbers. Discret. Math. 345(11): 113020 (2022) - [j244]Huan Zhou, Xuding Zhu:
Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles. Graphs Comb. 38(6): 170 (2022) - [j243]Xuding Zhu:
Every nice graph is (1, 5)-choosable. J. Comb. Theory B 157: 524-551 (2022) - [j242]Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu:
3-Degenerate induced subgraph of a planar graph. J. Graph Theory 99(2): 251-277 (2022) - [j241]Ringi Kim, Seog-Jin Kim, Xuding Zhu:
Signed colouring and list colouring of k-chromatic graphs. J. Graph Theory 99(4): 637-650 (2022) - [j240]Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu:
Decomposing planar graphs into graphs with degree restrictions. J. Graph Theory 101(2): 165-181 (2022) - [j239]Rongxing Xu, Xuding Zhu:
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs. SIAM J. Discret. Math. 36(4): 2585-2601 (2022) - 2021
- [j238]Reza Naserasr, Zhouningxin Wang, Xuding Zhu:
Circular Chromatic Number of Signed Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j237]Ming Han, Hal A. Kierstead, Xuding Zhu:
Every planar graph is 1-defective (9, 2)-paintable. Discret. Appl. Math. 294: 257-264 (2021) - [j236]Ligang Jin, Tsai-Lien Wong, Xuding Zhu:
Colouring of S-labelled planar graphs. Eur. J. Comb. 92: 103198 (2021) - [j235]Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Total weight choosability for Halin graphs. Electron. J. Graph Theory Appl. 9(1): 11-24 (2021) - [j234]Eun-Kyung Cho, Ilkyoo Choi, Yiting Jiang, Ringi Kim, Boram Park, Jiayan Yan, Xuding Zhu:
Generalized List Colouring of Graphs. Graphs Comb. 37(6): 2121-2127 (2021) - [j233]Xuding Zhu:
Relatively small counterexamples to Hedetniemi's conjecture. J. Comb. Theory B 146: 141-150 (2021) - [j232]Jialu Zhu, Xuding Zhu:
Chromatic λ-choosable and λ-paintable graphs. J. Graph Theory 98(4): 642-652 (2021) - 2020
- [j231]Yiting Jiang, Xuding Zhu:
$4$-Colouring of Generalized Signed Planar Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j230]Xuding Zhu:
A Note on the Poljak-Rödl Function. Electron. J. Comb. 27(3): 3 (2020) - [j229]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering Powers of Sparse Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j228]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A connected version of the graph coloring game. Discret. Appl. Math. 283: 744-750 (2020) - [j227]Balázs Keszegh, Xuding Zhu:
A note about online nonrepetitive coloring k-trees. Discret. Appl. Math. 285: 108-112 (2020) - [j226]Seog-Jin Kim, Alexandr V. Kostochka, Xuer Li, Xuding Zhu:
On-line DP-coloring of graphs. Discret. Appl. Math. 285: 443-453 (2020) - [j225]Xuer Li, Xuding Zhu:
The strong fractional choice number of series-parallel graphs. Discret. Math. 343(5): 111796 (2020) - [j224]Huajing Lu, Xuding Zhu:
The Alon-Tarsi number of planar graphs without cycles of lengths 4 and l. Discret. Math. 343(5): 111797 (2020) - [j223]Xuding Zhu:
A refinement of choosability of graphs. J. Comb. Theory B 141: 143-164 (2020) - [j222]Jaroslaw Grytczuk, Xuding Zhu:
The Alon-Tarsi number of a planar graph minus a matching. J. Comb. Theory B 145: 511-520 (2020) - [j221]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
Fractional DP-colorings of sparse graphs. J. Graph Theory 93(2): 203-221 (2020) - [j220]Jianzhang Hu, Xuding Zhu:
List coloring triangle-free planar graphs. J. Graph Theory 94(2): 278-298 (2020) - [j219]Rongxing Xu, Xuding Zhu:
Multiple list coloring of 3-choice critical graphs. J. Graph Theory 95(4): 638-654 (2020) - [i7]Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Xuding Zhu:
Clustering powers of sparse graphs. CoRR abs/2003.03605 (2020)
2010 – 2019
- 2019
- [j218]Claude Tardif, Xuding Zhu:
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the Poljak-Rödl Function. Electron. J. Comb. 26(4): 4 (2019) - [j217]Hui Lei, Suil O, Yongtang Shi, Douglas B. West, Xuding Zhu:
Extremal problems on saturation for the family of k-edge-connected graphs. Discret. Appl. Math. 260: 278-283 (2019) - [j216]Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu:
Graphs are (1, Δ+1)-choosable. Discret. Math. 342(1): 279-284 (2019) - [j215]Yiting Jiang, Daphne Der-Fen Liu, Yeong-Nan Yeh, Xuding Zhu:
Colouring of generalized signed triangle-free planar graphs. Discret. Math. 342(3): 836-843 (2019) - [j214]Genghua Fan, Hongbi Jiang, Ping Li, Douglas B. West, Daqing Yang, Xuding Zhu:
Extensions of matroid covering and packing. Eur. J. Comb. 76: 117-122 (2019) - [j213]Li-Da Tong, Hao-Yu Yang, Xuding Zhu:
Hamiltonian Spectra of Graphs. Graphs Comb. 35(4): 827-836 (2019) - [j212]Xuding Zhu:
The Alon-Tarsi number of planar graphs. J. Comb. Theory B 134: 354-358 (2019) - [j211]Yiting Jiang, Xuding Zhu:
Multiple list colouring triangle free planar graphs. J. Comb. Theory B 137: 112-117 (2019) - [i6]Clément Charpentier, Hervé Hocquard, Éric Sopena, Xuding Zhu:
A Connected Version of the Graph Coloring Game. CoRR abs/1907.12276 (2019) - 2018
- [j210]Grzegorz Gutowski, Ming Han, Tomasz Krawczyk, Xuding Zhu:
Defective 3-Paintability of Planar Graphs. Electron. J. Comb. 25(2): 2 (2018) - [j209]Hao Qi, Xuding Zhu:
The fault-diameter and wide-diameter of twisted hypercubes. Discret. Appl. Math. 235: 154-160 (2018) - [j208]Rongxing Xu, Yeong-Nan Yeh, Xuding Zhu:
List colouring of graphs and generalized Dyck paths. Discret. Math. 341(3): 810-819 (2018) - [j207]Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Graphs with maximum average degree less than 114 are (1, 3)-choosable. Discret. Math. 341(10): 2661-2671 (2018) - [j206]Yu-Chang Liang, Yunfang Tang, Tsai-Lien Wong, Xuding Zhu:
Total list weighting of graphs with bounded maximum average degree. Discret. Math. 341(10): 2672-2675 (2018) - [j205]Andrzej Dudek, Xavier Pérez-Giménez, Pawel Pralat, Hao Qi, Douglas B. West, Xuding Zhu:
Randomly twisted hypercubes. Eur. J. Comb. 70: 364-373 (2018) - [j204]Xinzhong Lv, Rongxing Xu, Xuding Zhu:
Greedy Nimk Game. J. Comb. Optim. 35(4): 1241-1249 (2018) - [j203]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. J. Graph Theory 87(3): 285-304 (2018) - [j202]Rongxing Xu, Xuding Zhu:
Bounded Greedy Nim. Theor. Comput. Sci. 746: 1-5 (2018) - 2017
- [j201]Tsai-Lien Wong, Xuding Zhu:
Permanent Index of Matrices Associated with Graphs. Electron. J. Comb. 24(1): 1 (2017) - [j200]Hao Qi, Xuding Zhu:
The wide-diameter of Zn, k. Discret. Appl. Math. 219: 193-201 (2017) - [j199]Balázs Keszegh, Xuding Zhu:
Choosability and paintability of the lexicographic product of graphs. Discret. Appl. Math. 223: 84-90 (2017) - [j198]Yunfang Tang, Xuding Zhu:
Total weight choosability of graphs with bounded maximum average degree. Discret. Math. 340(8): 2033-2042 (2017) - [j197]Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
DP-colorings of graphs with high chromatic number. Eur. J. Comb. 65: 122-129 (2017) - [j196]Yunfang Tang, Xuding Zhu:
Total weight choosability of Mycielski graphs. J. Comb. Optim. 33(1): 165-182 (2017) - [j195]Min Chen, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. J. Comb. Theory B 122: 741-756 (2017) - [j194]Xuding Zhu:
Multiple list colouring of planar graphs. J. Comb. Theory B 122: 794-799 (2017) - [j193]Jixian Meng, Gregory J. Puleo, Xuding Zhu:
On (4, 2)-Choosable Graphs. J. Graph Theory 85(2): 412-428 (2017) - [j192]Xuding Zhu:
A Hypercube Variant with Small Diameter. J. Graph Theory 85(3): 651-660 (2017) - [j191]Gerard Jennhwa Chang, Guan-Huei Duh, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Trees. SIAM J. Discret. Math. 31(2): 669-686 (2017) - 2016
- [j190]Tsai-Lien Wong, Xuding Zhu:
Every graph is (2, 3)-choosable. Comb. 36(1): 121-127 (2016) - [j189]Yaling Zhong, Xuding Zhu:
Fractional Thue chromatic number of graphs. Discret. Appl. Math. 200: 191-199 (2016) - [j188]Cheyu Lin, Xuding Zhu:
Circular total chromatic numbers of graphs. Discret. Math. 339(2): 857-865 (2016) - [j187]Ming Han, Xuding Zhu:
Locally planar graphs are 2-defective 4-paintable. Eur. J. Comb. 54: 35-50 (2016) - [j186]Andreas M. Hinz, S. Arumugam, Rangaswami Balakrishnan, S. Francis Raj, T. Karthick, K. Somasundaram, Xuding Zhu:
Preface. Electron. Notes Discret. Math. 53: 1-2 (2016) - [j185]Yunfang Tang, Tsai-Lien Wong, Xuding Zhu:
Total Weight Choosability of Cone Graphs. Graphs Comb. 32(3): 1203-1216 (2016) - [j184]Huanhua Zhao, Xuding Zhu:
(2+ϵ)-Nonrepetitive List Colouring of Paths. Graphs Comb. 32(4): 1635-1640 (2016) - [j183]Daphne Der-Fen Liu, Xuding Zhu:
A combinatorial proof for the circular chromatic number of Kneser graphs. J. Comb. Optim. 32(3): 765-774 (2016) - [j182]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions. J. Graph Theory 81(4): 403-413 (2016) - [j181]Fei-Huang Chang, Yu-Chang Liang, Zhishi Pan, Xuding Zhu:
Antimagic Labeling of Regular Graphs. J. Graph Theory 82(4): 339-349 (2016) - [j180]Daqing Yang, Xuding Zhu:
Strong Chromatic Index of Sparse Graphs. J. Graph Theory 83(4): 334-339 (2016) - [j179]Zhao Zhang, James Willson, Zaixin Lu, Weili Wu, Xuding Zhu, Ding-Zhu Du:
Approximating Maximum Lifetime k-Coverage Through Minimizing Weighted k-Cover in Homogeneous Wireless Sensor Networks. IEEE/ACM Trans. Netw. 24(6): 3620-3633 (2016) - 2015
- [j178]Robert Lukot'ka, Ján Mazák, Xuding Zhu:
Maximum 4-Degenerate Subgraph of a Planar Graph. Electron. J. Comb. 22(1): 1 (2015) - [j177]Thomas Mahoney, Jixian Meng, Xuding Zhu:
Characterization of $(2m, m)$-Paintable Graphs. Electron. J. Comb. 22(2): 2 (2015) - [j176]Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular chromatic indices of even degree regular graphs. Discret. Math. 338(7): 1154-1162 (2015) - [j175]Ming Han, Xuding Zhu:
Locally planar graphs are 5-paintable. Discret. Math. 338(10): 1740-1749 (2015) - [j174]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. Eur. J. Comb. 43: 295-305 (2015) - [j173]Wenchao Zhang, Xuding Zhu:
The game Grundy indices of graphs. J. Comb. Optim. 30(3): 596-611 (2015) - [j172]Xuding Zhu:
Circular flow number of highly edge connected signed graphs. J. Comb. Theory B 112: 93-103 (2015) - [j171]Daniel W. Cranston, Yu-Chang Liang, Xuding Zhu:
Regular Graphs of Odd Degree Are Antimagic. J. Graph Theory 80(1): 28-33 (2015) - [i5]Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. CoRR abs/1509.01301 (2015) - 2014
- [j170]Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. Discret. Appl. Math. 167: 45-51 (2014) - [j169]Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu:
Anti-magic labeling of trees. Discret. Math. 331: 9-14 (2014) - [j168]Balázs Keszegh, Balázs Patkós, Xuding Zhu:
Nonrepetitive colorings of lexicographic product of graphs. Discret. Math. Theor. Comput. Sci. 16(2): 97-110 (2014) - [j167]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards an on-line version of Ohba's conjecture. Eur. J. Comb. 36: 110-121 (2014) - [j166]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Erratum to "Application of polynomial method to on-line list colouring of graphs" [European J. Combin. 33(2012) 872-883]. Eur. J. Comb. 38: 23 (2014) - [j165]Jaehoon Kim, Alexandr V. Kostochka, Xuding Zhu:
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. Eur. J. Comb. 42: 26-48 (2014) - [j164]Jaroslav Nesetril, Patrice Ossona de Mendez, Xuding Zhu:
Colouring edges with many colours in cycles. J. Comb. Theory B 109: 102-119 (2014) - [j163]Yu-Chang Liang, Xuding Zhu:
Antimagic Labeling of Cubic Graphs. J. Graph Theory 75(1): 31-36 (2014) - [j162]Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular Chromatic Indices of Regular Graphs. J. Graph Theory 76(3): 169-193 (2014) - [c3]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower Bounds for On-line Graph Colorings. ISAAC 2014: 507-515 - [i4]Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu:
Lower bounds for on-line graph colorings. CoRR abs/1404.7259 (2014) - 2013
- [j161]Wai Hong Chan, Wai Chee Shiu, Pak Kiu Sun, Xuding Zhu:
The strong game colouring number of directed graphs. Discret. Math. 313(10): 1070-1077 (2013) - [j160]Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu:
Backbone coloring for graphs with large girths. Discret. Math. 313(18): 1799-1804 (2013) - [j159]Jonathan A. Noel, Bruce A. Reed, Douglas B. West, Hehui Wu, Xuding Zhu:
Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond. Electron. Notes Discret. Math. 43: 89-95 (2013) - [j158]D. J. Guan, Ko-Wei Lih, Xuding Zhu:
Preface: optimization in graphs. J. Comb. Optim. 25(4): 499-500 (2013) - [j157]Frédéric Havet, Xuding Zhu:
The game Grundy number of graphs. J. Comb. Optim. 25(4): 752-765 (2013) - [j156]Gerard Jennhwa Chang, Daphne Der-Fen Liu, Xuding Zhu:
A short proof for Chen's Alternative Kneser Coloring Lemma. J. Comb. Theory A 120(1): 159-163 (2013) - [j155]Tsai-Lien Wong, Xuding Zhu:
Partial Online List Coloring of Graphs. J. Graph Theory 74(3): 359-367 (2013) - [j154]Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, Xuding Zhu:
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. J. Graph Theory 74(4): 369-391 (2013) - [j153]Yu-Chang Liang, Xuding Zhu:
Anti-magic labelling of Cartesian product of graphs. Theor. Comput. Sci. 477: 1-5 (2013) - [i3]Robert Lukotka, Ján Mazák, Xuding Zhu:
Maximum 4-degenerate subgraph of a planar graph. CoRR abs/1305.6195 (2013) - [i2]Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. CoRR abs/1308.6739 (2013) - 2012
- [j152]Seog-Jin Kim, Young Soo Kwon, Daphne Der-Fen Liu, Xuding Zhu:
On-Line List Colouring of Complete Multipartite Graphs. Electron. J. Comb. 19(1): 41 (2012) - [j151]R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu:
Preface. Discret. Math. 312(9): 1493 (2012) - [j150]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Weighted-1-antimagic graphs of prime power order. Discret. Math. 312(14): 2162-2169 (2012) - [j149]Hal A. Kierstead, Chung-Ying Yang, Daqing Yang, Xuding Zhu:
Adapted game colouring of graphs. Eur. J. Comb. 33(4): 435-445 (2012) - [j148]Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu:
Application of polynomial method to on-line list colouring of graphs. Eur. J. Comb. 33(5): 872-883 (2012) - [j147]Tsai-Lien Wong, Jiaojiao Wu, Xuding Zhu:
Total weight choosability of Cartesian product of graphs. Eur. J. Comb. 33(8): 1725-1738 (2012) - [j146]Mickaël Montassier, Patrice Ossona de Mendez, André Raspaud, Xuding Zhu:
Decomposing a graph into forests. J. Comb. Theory B 102(1): 38-52 (2012) - [j145]Tsai-Lien Wong, Xuding Zhu:
Antimagic labelling of vertex weighted graphs. J. Graph Theory 70(3): 348-350 (2012) - [j144]Jiangxu Kong, Weifan Wang, Xuding Zhu:
The surviving rate of planar graphs. Theor. Comput. Sci. 416: 65-70 (2012) - 2011
- [j143]Xuding Zhu:
Graphs with chromatic numbers strictly less than their colouring numbers. Ars Math. Contemp. 4(1): 25-27 (2011) - [j142]Ákos Seress, Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of the actions of almost simple groups. Comb. 31(4): 489-506 (2011) - [j141]Francesca Fiorenzi, Pascal Ochem, Patrice Ossona de Mendez, Xuding Zhu:
Thue choosability of trees. Discret. Appl. Math. 159(17): 2045-2049 (2011) - [j140]Min Chen, André Raspaud, Nicolas Roussel, Xuding Zhu:
Acyclic 4-choosability of planar graphs. Discret. Math. 311(1): 92-101 (2011) - [j139]Xuding Zhu:
The fractional version of Hedetniemi's conjecture is true. Eur. J. Comb. 32(7): 1168-1175 (2011) - [j138]André Raspaud, Xuding Zhu:
Circular flow on signed graphs. J. Comb. Theory B 101(6): 464-479 (2011) - [j137]Weifan Wang, Xuding Zhu:
Entire colouring of plane graphs. J. Comb. Theory B 101(6): 490-501 (2011) - [j136]Tsai-Lien Wong, Xuding Zhu:
Total weight choosability of graphs. J. Graph Theory 66(3): 198-212 (2011) - [j135]Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. J. Graph Theory 67(3): 178-197 (2011) - [j134]Edita Mácajová, André Raspaud, Michael Tarsi, Xuding Zhu:
Short cycle covers of graphs and nowhere-zero flows. J. Graph Theory 68(4): 340-348 (2011) - [j133]Jaroslaw Grytczuk, Jakub Przybylo, Xuding Zhu:
Nonrepetitive list colourings of paths. Random Struct. Algorithms 38(1-2): 162-173 (2011) - [j132]Weifan Wang, Xubin Yue, Xuding Zhu:
The surviving rate of an outerplanar graph for the firefighter problem. Theor. Comput. Sci. 412(8-10): 913-921 (2011) - [c2]Ross Churchley, Jing Huang, Xuding Zhu:
Complexity of Cycle Transverse Matching Problems. IWOCA 2011: 135-143 - [e1]Weifan Wang, Xuding Zhu, Ding-Zhu Du:
Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings. Lecture Notes in Computer Science 6831, Springer 2011, ISBN 978-3-642-22615-1 [contents] - [i1]Jakub Kozik, Piotr Micek, Xuding Zhu:
Towards on-line Ohba's conjecture. CoRR abs/1111.5458 (2011) - 2010
- [j131]Daqing Yang, Xuding Zhu:
Game Colouring Directed Graphs. Electron. J. Comb. 17(1) (2010) - [j130]Gerard J. Chang, Jiaojiao Wu, Xuding Zhu:
Rainbow domination on trees. Discret. Appl. Math. 158(1): 8-12 (2010) - [j129]Mickaël Montassier, Arnaud Pêcher, André Raspaud, Douglas B. West, Xuding Zhu:
Decomposition of sparse graphs, with application to game coloring number. Discret. Math. 310(10-11): 1520-1523 (2010) - [j128]Nicolas Roussel, Xuding Zhu:
Total coloring of planar graphs of maximum degree eight. Inf. Process. Lett. 110(8-9): 321-324 (2010) - [j127]Mickaël Montassier, André Raspaud, Xuding Zhu:
Decomposition of sparse graphs into two forests, one having bounded maximum degree. Inf. Process. Lett. 110(20): 913-916 (2010) - [j126]Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. J. Graph Theory 63(4): 311-323 (2010) - [j125]Leizhen Cai, Weifan Wang, Xuding Zhu:
Choosability of toroidal graphs without short cycles. J. Graph Theory 65(1): 1-15 (2010) - [j124]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. J. Graph Theory 65(2): 163-172 (2010) - [j123]Zhishi Pan, Xuding Zhu:
Multiple Coloring of Cone Graphs. SIAM J. Discret. Math. 24(4): 1515-1526 (2010)
2000 – 2009
- 2009
- [j122]Xuding Zhu:
On-Line List Colouring of Graphs. Electron. J. Comb. 16(1) (2009) - [j121]Xuding Zhu:
Bipartite density of triangle-free subcubic graphs. Discret. Appl. Math. 157(4): 710-714 (2009) - [j120]Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of group actions. Discret. Math. 309(6): 1760-1765 (2009) - [j119]Hungyung Chang, Xuding Zhu:
Colouring games on outerplanar graphs and trees. Discret. Math. 309(10): 3185-3196 (2009) - [j118]Wensong Lin, Xuding Zhu:
Circular game chromatic number of graphs. Discret. Math. 309(13): 4495-4501 (2009) - [j117]Louis Esperet, Xuding Zhu:
Game colouring of the square of graphs. Discret. Math. 309(13): 4514-4521 (2009) - [j116]Xuding Zhu:
Colouring graphs with bounded generalized colouring number. Discret. Math. 309(18): 5562-5568 (2009) - [j115]Albert Guan, Xuding Zhu:
Adaptable choosability of planar graphs with sparse short cycles. Discret. Math. 309(20): 6044-6047 (2009) - [j114]Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu:
Adaptable chromatic number of graph products. Discret. Math. 309(21): 6153-6159 (2009) - [j113]Mickaël Montassier, André Raspaud, Xuding Zhu:
An upper bound on adaptable choosability of graphs. Eur. J. Comb. 30(2): 351-355 (2009) - [j112]Xuding Zhu:
Bipartite subgraphs of triangle-free subcubic graphs. J. Comb. Theory B 99(1): 62-83 (2009) - [j111]Louis Esperet, Mickaël Montassier, Xuding Zhu:
Adapted list coloring of planar graphs. J. Graph Theory 62(2): 127-138 (2009) - [j110]Hal A. Kierstead, Bojan Mohar, Simon Spacapan, Daqing Yang, Xuding Zhu:
The Two-Coloring Number and Degenerate Colorings of Planar Graphs. SIAM J. Discret. Math. 23(3): 1548-1560 (2009) - [j109]Hamed Hatami, Xuding Zhu:
The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three. SIAM J. Discret. Math. 23(4): 1762-1775 (2009) - 2008
- [j108]Serguei Norine, Xuding Zhu:
Circular Degree Choosability. Electron. J. Comb. 15(1) (2008) - [j107]Jiaojiao Wu, Xuding Zhu:
Lower bounds for the game colouring number of partial k-trees and planar graphs. Discret. Math. 308(12): 2637-2642 (2008) - [j106]Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian sum of graphs. Discret. Math. 308(24): 5928-5936 (2008) - [j105]Jiaojiao Wu, Xuding Zhu:
The 6-relaxed game chromatic number of outerplanar graphs. Discret. Math. 308(24): 5974-5980 (2008) - [j104]Pavol Hell, Xuding Zhu:
On the adaptable chromatic number of graphs. Eur. J. Comb. 29(4): 912-921 (2008) - [j103]Zhishi Pan, Xuding Zhu:
Minimal circular-imperfect graphs of large clique number and large independence number. Eur. J. Comb. 29(4): 1055-1063 (2008) - [j102]Daqing Yang, Xuding Zhu:
Activation strategy for asymmetric marking games. Eur. J. Comb. 29(5): 1123-1132 (2008) - [j101]Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number of distance graphs generated by two-interval sets. Eur. J. Comb. 29(7): 1733-1743 (2008) - [j100]Xuding Zhu:
Refined activation strategy for the marking game. J. Comb. Theory B 98(1): 1-18 (2008) - [j99]Douglas B. West, Xuding Zhu:
Circular chromatic index of Cartesian products of graphs. J. Graph Theory 57(1): 7-18 (2008) - [j98]Serguei Norine, Tsai-Lien Wong, Xuding Zhu:
Circular choosability via combinatorial Nullstellensatz. J. Graph Theory 59(3): 190-204 (2008) - [j97]Xuding Zhu:
Game coloring the Cartesian product of graphs. J. Graph Theory 59(4): 261-278 (2008) - [j96]Alexandr V. Kostochka, Xuding Zhu:
Adapted List Coloring of Graphs and Hypergraphs. SIAM J. Discret. Math. 22(1): 398-408 (2008) - 2007
- [j95]Sandi Klavzar, Xuding Zhu:
Cartesian powers of graphs can be distinguished by two labels. Eur. J. Comb. 28(1): 303-310 (2007) - [j94]Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. Electron. Notes Discret. Math. 29: 451-455 (2007) - [j93]Gerard J. Chang, Hung-Lin Fu, Xuding Zhu:
Editorial note. J. Comb. Optim. 14(2-3): 111-112 (2007) - [j92]Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu:
The circular chromatic index of graphs of high girth. J. Comb. Theory B 97(1): 1-13 (2007) - [j91]André Raspaud, Xuding Zhu:
List circular coloring of trees and cycles. J. Graph Theory 55(3): 249-265 (2007) - [j90]Tomasz Bartnicki, Jaroslaw Grytczuk, Hal A. Kierstead, Xuding Zhu:
The Map-Coloring Game. Am. Math. Mon. 114(9): 793-803 (2007) - 2006
- [j89]Daniel Král', Li-Da Tong, Xuding Zhu:
Upper hamiltonian numbers and hamiltonian spectra of graphs. Australas. J Comb. 35: 329-340 (2006) - [j88]Hungyung Chang, Xuding Zhu:
The d-relaxed game chromatic index of k-degenerated graphs. Australas. J Comb. 36: 73-82 (2006) - [j87]Jiaojiao Wu, Xuding Zhu:
Relaxed game chromatic number of outer planar graphs. Ars Comb. 81 (2006) - [j86]Xuding Zhu, Shuyuan Lin:
Uniquely circular colourable and uniquely fractional colourable graphs of large girth. Contributions Discret. Math. 1(1) (2006) - [j85]Arnaud Pêcher, Xuding Zhu:
On the circular chromatic number of circular partitionable graphs. J. Graph Theory 52(4): 294-306 (2006) - 2005
- [j84]Arnaud Pêcher, Annegret Wagler, Xuding Zhu:
Three classes of minimal circular-imperfect graphs. Electron. Notes Discret. Math. 19: 9-15 (2005) - [j83]Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian Sum of Graphs. Electron. Notes Discret. Math. 22: 305-309 (2005) - [j82]Zhishi Pan, Xuding Zhu:
Graphs of Large Girth with Prescribed Partial Circular Colourings. Graphs Comb. 21(1): 119-129 (2005) - [j81]Xuding Zhu:
Circular perfect graphs. J. Graph Theory 48(3): 186-209 (2005) - [j80]Xuding Zhu:
Circular choosability of graphs. J. Graph Theory 48(3): 210-218 (2005) - [j79]Daphne Der-Fen Liu, Xuding Zhu:
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146. J. Graph Theory 48(4): 329-330 (2005) - [j78]Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005) - [j77]Daphne Der-Fen Liu, Xuding Zhu:
Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs. SIAM J. Discret. Math. 19(2): 281-293 (2005) - [j76]Daphne Der-Fen Liu, Xuding Zhu:
Multilevel Distance Labelings for Paths and Cycles. SIAM J. Discret. Math. 19(3): 610-621 (2005) - [j75]Hong-Gwa Yeh, Xuding Zhu:
Resource-sharing system scheduling and circular chromatic number. Theor. Comput. Sci. 332(1-3): 447-460 (2005) - 2004
- [j74]Wenjie He, Jiaojiao Wu, Xuding Zhu:
Relaxed game chromatic number of trees and outerplanar graphs. Discret. Math. 281(1-3): 209-219 (2004) - [j73]Mohammad Hosseini Dolama, Éric Sopena, Xuding Zhu:
Incidence coloring of k-degenerated graphs. Discret. Math. 283(1-3): 121-128 (2004) - [j72]Hossein Hajiabolhassan, Xuding Zhu:
Sparse H-Colourable Graphs of Bounded Maximum Degree. Graphs Comb. 20(1): 65-71 (2004) - [j71]Jaroslav Nesetril, Xuding Zhu:
On sparse graphs with given colorings and homomorphisms. J. Comb. Theory B 90(1): 161-172 (2004) - [j70]Zhishi Pan, Xuding Zhu:
Density of the circular chromatic numbers of series-parallel graphs. J. Graph Theory 46(1): 57-68 (2004) - [j69]Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number and circular chromatic number for distance graphs with large clique size. J. Graph Theory 47(2): 129-146 (2004) - [j68]W. R. Chen, Frank K. Hwang, Xuding Zhu:
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks. SIAM J. Discret. Math. 17(3): 446-452 (2004) - 2003
- [j67]Daphne Der-Fen Liu, Xuding Zhu:
Circulant Distant Two Labeling and Circular Chromatic Number. Ars Comb. 69 (2003) - [j66]Chun-Yen Chou, Wei-Fan Wang, Xuding Zhu:
Relaxed game chromatic number of graphs. Discret. Math. 262(1-3): 89-98 (2003) - [j65]Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu:
Construction of Kn-minor free graphs with given circular chromatic number. Discret. Math. 263(1-3): 191-206 (2003) - [j64]Xuding Zhu:
Circular chromatic numbers of a class of distance graphs. Discret. Math. 265(1-3): 337-350 (2003) - [j63]Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu:
Coloring the square of a K4-minor free graph. Discret. Math. 269(1-3): 303-309 (2003) - [j62]Hong-Gwa Yeh, Xuding Zhu:
4-Colorable 6-regular toroidal graphs. Discret. Math. 273(1-3): 261-274 (2003) - [j61]Xuding Zhu:
An Analogue of Hajós' Theorem for the Circular Chromatic Number (II). Graphs Comb. 19(3): 419-432 (2003) - [j60]Hossein Hajiabolhassan, Xuding Zhu:
Circular chromatic number of Kneser graphs. J. Comb. Theory B 88(2): 299-303 (2003) - [j59]Zhishi Pan, Xuding Zhu:
Construction of graphs with given circular flow numbers. J. Graph Theory 43(4): 304-318 (2003) - [j58]Hossein Hajiabolhassan, Xuding Zhu:
Circular chromatic number of subgraphs. J. Graph Theory 44(2): 95-105 (2003) - [j57]Hossein Hajiabolhassan, Xuding Zhu:
Circular chromatic number and Mycielski construction. J. Graph Theory 44(2): 106-115 (2003) - 2002
- [j56]Claude Tardif, Xuding Zhu:
The level of nonmultiplicativity of graphs. Discret. Math. 244(1-3): 461-471 (2002) - [j55]Zhishi Pan, Xuding Zhu:
The circular chromatic number of series-parallel graphs of large odd girth. Discret. Math. 245(1-3): 235-246 (2002) - [j54]Frank K. Hwang, Xuding Zhu:
Preface. Discret. Math. 253(1-3): 1- (2002) - [j53]Claude Tardif, Xuding Zhu:
On Hedetniemi's conjecture and the colour template scheme. Discret. Math. 253(1-3): 77-85 (2002) - [j52]Zhishi Pan, Xuding Zhu:
Tight relation between the circular chromatic number and the girth of series-parallel graphs. Discret. Math. 254(1-3): 393-404 (2002) - [j51]Daphne Der-Fen Liu, Xuding Zhu:
Asymptotic Clique Covering Ratios of Distance Graphs. Eur. J. Comb. 23(3): 315-327 (2002) - [j50]Xuding Zhu:
Circular Colouring and Orientation of Graphs. J. Comb. Theory B 86(1): 109-113 (2002) - [j49]Xuding Zhu:
Circular chromatic number of distance graphs with distance sets of cardinality 3. J. Graph Theory 41(3): 195-207 (2002) - [j48]Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu:
Edge-partitions of planar graphs and their game coloring numbers. J. Graph Theory 41(4): 307-317 (2002) - 2001
- [j47]Xuding Zhu:
Circular Chromatic Number of Planar Graphs of Large Odd Girth. Electron. J. Comb. 8(1) (2001) - [j46]Xuding Zhu:
Circular chromatic number: a survey. Discret. Math. 229(1-3): 371-410 (2001) - [j45]Jaroslav Nesetril, Xuding Zhu:
Construction of sparse graphs with prescribed circular colorings. Discret. Math. 233(1-3): 277-291 (2001) - [j44]Leizhen Cai, Xuding Zhu:
Game chromatic index of k-degenerate graphs. J. Graph Theory 36(3): 144-155 (2001) - [c1]Xuding Zhu:
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs. Graphs, Morphisms and Statistical Physics 2001: 177-193 - 2000
- [j43]Gerard J. Chang, Xuding Zhu:
Pseudo-Hamiltonian-connected graphs. Discret. Appl. Math. 100(3): 145-153 (2000) - [j42]Xuding Zhu:
The game coloring number of pseudo partial k-trees. Discret. Math. 215: 245-262 (2000) - [j41]Pavol Hell, Xuding Zhu:
The circular chromatic number of series-parallel graphs. J. Graph Theory 33(1): 14-24 (2000) - [j40]Chihyun Chien, Xuding Zhu:
The circular chromatic number of series-parallel graphs with large girth. J. Graph Theory 33(4): 185-198 (2000)
1990 – 1999
- 1999
- [j39]Xuding Zhu:
Graphs Whose Circular Chromatic Number Equals the Chromatic Number. Comb. 19(1): 139-149 (1999) - [j38]Thomas Dinski, Xuding Zhu:
A bound for the game chromatic number of graphs. Discret. Math. 196(1-3): 109-115 (1999) - [j37]Gerard J. Chang, Lingling Huang, Xuding Zhu:
Circular chromatic numbers of Mycielski's graphs. Discret. Math. 205(1-3): 23-37 (1999) - [j36]Xuding Zhu:
The Game Coloring Number of Planar Graphs. J. Comb. Theory B 75(2): 245-258 (1999) - [j35]Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu:
Distance Graphs and T-Coloring. J. Comb. Theory B 75(2): 259-269 (1999) - [j34]Xuding Zhu:
Planar Graphs with Circular Chromatic Numbers between 3 and 4. J. Comb. Theory B 76(2): 170-200 (1999) - [j33]Xuding Zhu:
Construction of uniquely H-colorable graphs. J. Graph Theory 30(1): 1-6 (1999) - [j32]Xuding Zhu:
A simple proof of Moser's theorem. J. Graph Theory 30(1): 19-26 (1999) - [j31]D. J. Guan, Xuding Zhu:
Game chromatic number of outerplanar graphs. J. Graph Theory 30(1): 67-70 (1999) - [j30]Daphne Der-Fen Liu, Xuding Zhu:
Distance graphs with missing multiples in the distance sets. J. Graph Theory 30(4): 245-259 (1999) - [j29]Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu:
Star Extremal Circulant Graphs. SIAM J. Discret. Math. 12(4): 491-499 (1999) - 1998
- [j28]Xuding Zhu:
Chromatic Ramsey numbers. Discret. Math. 190(1-3): 215-222 (1998) - [j27]Gerard J. Chang, Lingling Huang, Xuding Zhu:
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs. Eur. J. Comb. 19(4): 423-431 (1998) - [j26]Walter A. Deuber, Xuding Zhu:
Relaxed Coloring of a Graph. Graphs Comb. 14(2): 121-130 (1998) - [j25]Zoltán Füredi, Peter Horák, Chandra M. Pareek, Xuding Zhu:
Minimal Oriented Graphs of Diameter 2. Graphs Comb. 14(4): 345-350 (1998) - [j24]Xuding Zhu:
Pattern Periodic Coloring of Distance Graphs. J. Comb. Theory B 73(2): 195-206 (1998) - [j23]Hongbing Fan, Xuding Zhu:
Oriented walk double covering and bidirectional double tracing. J. Graph Theory 29(2): 89-102 (1998) - [j22]D. J. Guan, Xuding Zhu:
Multiple Capacity Vehicle Routing on Paths. SIAM J. Discret. Math. 11(4): 590-602 (1998) - 1997
- [j21]Xuding Zhu:
A note on graph reconstruction. Ars Comb. 46 (1997) - [j20]Huishan Zhou, Xuding Zhu:
Multiplicativity of Acyclic Local Tournaments. Comb. 17(1): 135-145 (1997) - [j19]Walter A. Deuber, Xuding Zhu:
The chromatic numbers of distance graphs. Discret. Math. 165-166: 195-204 (1997) - [j18]D. J. Guan, Xuding Zhu:
A Coloring Problem for Weighted Graphs. Inf. Process. Lett. 61(2): 77-81 (1997) - [j17]Alexandr V. Kostochka, Éric Sopena, Xuding Zhu:
Acyclic and oriented chromatic numbers of graphs. J. Graph Theory 24(4): 331-340 (1997) - 1996
- [j16]Eckhard Steffen, Xuding Zhu:
Star Chromatic Numbers of Graphs. Comb. 16(3): 439-448 (1996) - [j15]Pavol Hell, Jaroslav Nesetril, Xuding Zhu:
Complexity of Tree Homomorphisms. Discret. Appl. Math. 70(1): 23-36 (1996) - [j14]Guogang Gao, Xuding Zhu:
Star-extremal graphs and the lexicographic product. Discret. Math. 152(1-3): 147-156 (1996) - [j13]Xuding Zhu:
On the bounds for the ultimate independence ratio of a graph. Discret. Math. 156(1-3): 229-236 (1996) - [j12]Xuding Zhu:
Uniquely H-colorable graphs with large girth. J. Graph Theory 23(1): 33-41 (1996) - [j11]Jaroslav Nesetril, Xuding Zhu:
On bounded treewidth duality of graphs. J. Graph Theory 23(2): 151-162 (1996) - [j10]Walter A. Deuber, Xuding Zhu:
Circular colorings of weighted graphs. J. Graph Theory 23(4): 365-376 (1996) - 1995
- [j9]Vojtech Rödl, Norbert Sauer, Xuding Zhu:
Ramsey Families which Exclude a Graph. Comb. 15(4): 589-596 (1995) - [j8]Xuding Zhu:
A Polynomial Algorithm for Homomorphisms to Oriented Cycles. J. Algorithms 19(3): 333-345 (1995) - [j7]Pavol Hell, Huishan Zhou, Xuding Zhu:
On homomorphisms to acyclic local tournaments. J. Graph Theory 20(4): 467-471 (1995) - [j6]Pavol Hell, Xuding Zhu:
The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discret. Math. 8(2): 208-222 (1995) - 1994
- [j5]Pavol Hell, Xuding Zhu:
Homomorphisms to oriented paths. Discret. Math. 132(1-3): 107-114 (1994) - [j4]Pavol Hell, Huishan Zhou, Xuding Zhu:
Multiplicativity of Oriented Cycles. J. Comb. Theory B 60(2): 239-253 (1994) - 1993
- [j3]Pavol Hell, Huishan Zhou, Xuding Zhu:
Homomorphisms to oriented cycles. Comb. 13(4): 421-433 (1993) - 1992
- [j2]Xuding Zhu:
A simple proof of the multiplicativity of directed cycles of prime power length. Discret. Appl. Math. 36(3): 313-316 (1992) - [j1]Xuding Zhu:
Star chromatic numbers and products of graphs. J. Graph Theory 16(6): 557-569 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
