Baogang Xu
Orcid: 0000-0003-0435-6103
According to our database1,
Baogang Xu
authored at least 70 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Discret. Appl. Math., 2024
2023
A Tight Linear Bound to the Chromatic Number of $(P_5, K_1+(K_1\cup K_3))$-Free Graphs.
Graphs Comb., June, 2023
2022
Discret. Math., 2022
2021
2020
Discret. Appl. Math., 2020
2019
SIAM J. Discret. Math., 2019
2018
2017
Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
Ars Comb., 2017
2016
2015
Cyclic 9-coloring of plane graphs with maximum face degree six.
Ars Comb., 2015
2014
IEEE Trans. Control. Syst. Technol., 2014
2013
Theor. Comput. Sci., 2013
On Some Properties of Cages.
Ars Comb., 2013
2012
Int. J. Autom. Comput., 2012
On a graph partition result of Kuhn and Osthus.
Ars Comb., 2012
Edge choosability and total choosability of toroidal graphs without intersecting triangles.
Ars Comb., 2012
2011
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles.
Discret. Math., 2011
Disturbance rejection in repetitive-control systems based on equivalent-input-disturbance approach.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011
2010
Discret. Appl. Math., 2010
2009
Discret. Math. Algorithms Appl., 2009
Discret. Math., 2009
Ordering graphs with maximum degree 3 by their indices.
Ars Comb., 2009
(3, 2)*-choosability of triangle-free toroidal graphs.
Ars Comb., 2009
2008
J. Comb. Theory B, 2008
2007
Eur. J. Comb., 2007
Discret. Appl. Math., 2007
2006
J. Glob. Optim., 2006
Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.
Ars Comb., 2006
2005
2002
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability.
Discret. Math., 2002
2001
J. Comb. Theory B, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
1999
1998
1996