Xuding Zhu
Orcid: 0000000255025390Affiliations:
 Zhejiang Normal University, China
 National Sun Yatsen University, Kaohsiung, Department of Applied Mathematics
 Simon Fraser University, Burnaby, School of Computing Science
According to our database^{1},
Xuding Zhu
authored at least 263 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on orcid.org

on zjnu.edu.cn
On csauthors.net:
Bibliography
2024
J. Graph Theory, March, 2024
2023
Bad list assignments for nonk $k$choosable k $k$chromatic graphs with 2k+2 $2k+2$vertices.
J. Graph Theory, December, 2023
Discret. Appl. Math., December, 2023
2Reconstructibility of Strongly Regular Graphs and 2Partially DistanceRegular Graphs.
Graphs Comb., October, 2023
SIAM J. Discret. Math., September, 2023
J. Graph Theory, July, 2023
Discret. Appl. Math., May, 2023
J. Graph Theory, 2023
J. Comb. Theory B, 2023
Electron. J. Comb., 2023
Electron. J. Comb., 2023
2022
The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs.
SIAM J. Discret. Math., December, 2022
J. Graph Theory, 2022
J. Graph Theory, 2022
J. Graph Theory, 2022
J. Comb. Theory B, 2022
Multiple DPColoring of Planar Graphs Without 3Cycles and Normally Adjacent 4Cycles.
Graphs Comb., 2022
Discret. Math., 2022
Discret. Math., 2022
Discret. Math., 2022
Electron. J. Comb., 2022
Electron. J. Comb., 2022
2021
J. Graph Theory, 2021
J. Comb. Theory B, 2021
Graphs Comb., 2021
Electron. J. Graph Theory Appl., 2021
Eur. J. Comb., 2021
Discret. Appl. Math., 2021
Electron. J. Comb., 2021
2020
J. Graph Theory, 2020
J. Graph Theory, 2020
J. Graph Theory, 2020
J. Comb. Theory B, 2020
J. Comb. Theory B, 2020
Discret. Math., 2020
Discret. Math., 2020
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
Electron. J. Comb., 2020
Electron. J. Comb., 2020
Electron. J. Comb., 2020
2019
J. Comb. Theory B, 2019
J. Comb. Theory B, 2019
Graphs Comb., 2019
Eur. J. Comb., 2019
Discret. Math., 2019
Discret. Math., 2019
Discret. Appl. Math., 2019
A Note on Hedetniemi's Conjecture, Stahl's Conjecture and the PoljakRödl Function.
Electron. J. Comb., 2019
2018
Theor. Comput. Sci., 2018
J. Graph Theory, 2018
J. Comb. Optim., 2018
Eur. J. Comb., 2018
Discret. Math., 2018
Discret. Math., 2018
Discret. Math., 2018
Discret. Appl. Math., 2018
Electron. J. Comb., 2018
2017
SIAM J. Discret. Math., 2017
J. Graph Theory, 2017
J. Graph Theory, 2017
J. Comb. Theory B, 2017
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2.
J. Comb. Theory B, 2017
J. Comb. Optim., 2017
Eur. J. Comb., 2017
Discret. Math., 2017
Discret. Appl. Math., 2017
Discret. Appl. Math., 2017
Electron. J. Comb., 2017
2016
Approximating Maximum Lifetime kCoverage Through Minimizing Weighted kCover in Homogeneous Wireless Sensor Networks.
IEEE/ACM Trans. Netw., 2016
J. Graph Theory, 2016
J. Graph Theory, 2016
J. Graph Theory, 2016
J. Comb. Optim., 2016
Graphs Comb., 2016
Graphs Comb., 2016
Electron. Notes Discret. Math., 2016
Eur. J. Comb., 2016
Discret. Math., 2016
Discret. Appl. Math., 2016
Comb., 2016
2015
J. Graph Theory, 2015
J. Comb. Theory B, 2015
J. Comb. Optim., 2015
Beyond Ohba's Conjecture: A bound on the choice number of kchromatic graphs with n vertices.
Eur. J. Comb., 2015
Discret. Math., 2015
Discret. Math., 2015
Electron. J. Comb., 2015
Electron. J. Comb., 2015
2014
J. Graph Theory, 2014
J. Graph Theory, 2014
J. Comb. Theory B, 2014
Eur. J. Comb., 2014
Improper coloring of sparse graphs with a given girth, I: (0, 1)colorings of trianglefree graphs.
Eur. J. Comb., 2014
Erratum to "Application of polynomial method to online list colouring of graphs" [European J. Combin. 33(2012) 872883].
Eur. J. Comb., 2014
Discret. Math. Theor. Comput. Sci., 2014
Discret. Math., 2014
Discret. Appl. Math., 2014
Proceedings of the Algorithms and Computation  25th International Symposium, 2014
2013
Theor. Comput. Sci., 2013
J. Graph Theory, 2013
J. Graph Theory, 2013
J. Comb. Theory A, 2013
J. Comb. Optim., 2013
J. Comb. Optim., 2013
Electron. Notes Discret. Math., 2013
Discret. Math., 2013
Discret. Math., 2013
Beyond Ohba's Conjecture: A bound on the choice number of <i>k</i>chromatic graphs with <i>n</i> vertices.
CoRR, 2013
2012
Theor. Comput. Sci., 2012
J. Graph Theory, 2012
J. Comb. Theory B, 2012
Eur. J. Comb., 2012
Eur. J. Comb., 2012
Eur. J. Comb., 2012
Discret. Math., 2012
Discret. Math., 2012
Electron. J. Comb., 2012
2011
Theor. Comput. Sci., 2011
Random Struct. Algorithms, 2011
J. Graph Theory, 2011
J. Graph Theory, 2011
J. Graph Theory, 2011
J. Comb. Theory B, 2011
J. Comb. Theory B, 2011
Eur. J. Comb., 2011
Discret. Math., 2011
Discret. Appl. Math., 2011
CoRR, 2011
Comb., 2011
Ars Math. Contemp., 2011
Proceedings of the Combinatorial Algorithms  22nd International Workshop, 2011
2010
SIAM J. Discret. Math., 2010
J. Graph Theory, 2010
J. Graph Theory, 2010
Inf. Process. Lett., 2010
Decomposition of sparse graphs into two forests, one having bounded maximum degree.
Inf. Process. Lett., 2010
Discret. Math., 2010
Discret. Appl. Math., 2010
Electron. J. Comb., 2010
2009
SIAM J. Discret. Math., 2009
SIAM J. Discret. Math., 2009
J. Graph Theory, 2009
J. Comb. Theory B, 2009
Eur. J. Comb., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Math., 2009
Discret. Appl. Math., 2009
Electron. J. Comb., 2009
2008
SIAM J. Discret. Math., 2008
J. Graph Theory, 2008
J. Graph Theory, 2008
J. Graph Theory, 2008
J. Comb. Theory B, 2008
Eur. J. Comb., 2008
Minimal circularimperfect graphs of large clique number and large independence number.
Eur. J. Comb., 2008
Eur. J. Comb., 2008
Eur. J. Comb., 2008
Discret. Math., 2008
Discret. Math., 2008
Electron. J. Comb., 2008
2007
Am. Math. Mon., 2007
J. Graph Theory, 2007
J. Comb. Theory B, 2007
J. Comb. Optim., 2007
Electron. Notes Discret. Math., 2007
Eur. J. Comb., 2007
2006
J. Graph Theory, 2006
Uniquely circular colourable and uniquely fractional colourable graphs of large girth.
Contributions Discret. Math., 2006
Relaxed game chromatic number of outer planar graphs.
Ars Comb., 2006
Australas. J Comb., 2006
Australas. J Comb., 2006
2005
Theor. Comput. Sci., 2005
SIAM J. Discret. Math., 2005
SIAM J. Discret. Math., 2005
J. Graph Theory, 2005
J. Graph Theory, 2005
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" <i>Journal of Graph Theory</i> 47(2) 2004, 129146.
J. Graph Theory, 2005
J. Graph Theory, 2005
Graphs Comb., 2005
Electron. Notes Discret. Math., 2005
Electron. Notes Discret. Math., 2005
2004
Equivalence of the 1Rate Model to the Classical Model on Strictly Nonblocking Switching Networks.
SIAM J. Discret. Math., 2004
J. Graph Theory, 2004
Fractional chromatic number and circular chromatic number for distance graphs with large clique size.
J. Graph Theory, 2004
J. Comb. Theory B, 2004
Graphs Comb., 2004
Discret. Math., 2004
Discret. Math., 2004
2003
J. Graph Theory, 2003
J. Graph Theory, 2003
J. Graph Theory, 2003
J. Comb. Theory B, 2003
Graphs Comb., 2003
Discret. Math., 2003
Discret. Math., 2003
Discret. Math., 2003
Construction of <i>K<sub>n</sub></i>minor free graphs with given circular chromatic number.
Discret. Math., 2003
Discret. Math., 2003
Circulant Distant Two Labeling and Circular Chromatic Number.
Ars Comb., 2003
2002
J. Graph Theory, 2002
J. Graph Theory, 2002
J. Comb. Theory B, 2002
Eur. J. Comb., 2002
Discret. Math., 2002
Discret. Math., 2002
Discret. Math., 2002
Tight relation between the circular chromatic number and the girth of seriesparallel graphs.
Discret. Math., 2002
Discret. Math., 2002
2001
J. Graph Theory, 2001
Discret. Math., 2001
Discret. Math., 2001
Electron. J. Comb., 2001
Proceedings of the Graphs, 2001
2000
J. Graph Theory, 2000
J. Graph Theory, 2000
Discret. Math., 2000
Discret. Appl. Math., 2000
1999
SIAM J. Discret. Math., 1999
J. Graph Theory, 1999
J. Graph Theory, 1999
J. Graph Theory, 1999
J. Graph Theory, 1999
J. Comb. Theory B, 1999
J. Comb. Theory B, 1999
J. Comb. Theory B, 1999
Discret. Math., 1999
Discret. Math., 1999
Comb., 1999
1998
SIAM J. Discret. Math., 1998
J. Graph Theory, 1998
J. Comb. Theory B, 1998
Graphs Comb., 1998
Graphs Comb., 1998
Eur. J. Comb., 1998
Discret. Math., 1998
1997
J. Graph Theory, 1997
Inf. Process. Lett., 1997
Discret. Math., 1997
Comb., 1997
A note on graph reconstruction.
Ars Comb., 1997
1996
J. Graph Theory, 1996
J. Graph Theory, 1996
J. Graph Theory, 1996
Discret. Math., 1996
Discret. Math., 1996
Discret. Appl. Math., 1996
Comb., 1996
1995
SIAM J. Discret. Math., 1995
J. Graph Theory, 1995
J. Algorithms, 1995
Comb., 1995
1994
J. Comb. Theory B, 1994
Discret. Math., 1994
1993
Comb., 1993
1992
J. Graph Theory, 1992
Discret. Appl. Math., 1992