According to our database
1,
Baogang Xu
authored at least 76 papers
between 1996 and 2025.
Collaborative distances:
2025
Structure and Coloring of a Family of (P<sub>7,</sub> C<sub>5</sub>)-Free Graphs.
Graphs Comb., August, 2025
Maximum Bisections of Graphs Without Adjacent Quadrilaterals.
Graphs Comb., February, 2025
Coloring of (P6,dart, K4)-free graphs.
Discret. Appl. Math., 2025
Structure and coloring of (P7, C5, diamond)-free graphs.
Discret. Appl. Math., 2025
2024
The chromatic number of heptagraphs.
J. Graph Theory, 2024
Perfect divisibility and coloring of some fork-free graphs.
Discret. Math., 2024
Divisibility and coloring of some P5-free graphs.
Discret. Appl. Math., 2024
Structure of some ( P7, C4)-free graphs with application to colorings.
Discret. Appl. Math., 2024
2023
Coloring of Some Crown-Free Graphs.
Graphs Comb., October, 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
Perfect divisibility and coloring of some fork-free graphs.
CoRR, 2023
2022
On connected partition with degree constraints.
Discret. Math., 2022
On the chromatic number of some <i>P</i><sub>5</sub>-free graphs.
Discret. Math., 2022
2021
Partitions of Multigraphs Without C<sub>4</sub>.
Graphs Comb., 2021
On a conjecture of Schweser and Stiebitz.
Discret. Appl. Math., 2021
On the chromatic number of a family of odd hole free graphs.
CoRR, 2021
2020
Partitions of graphs and multigraphs under degree constraints.
Discret. Appl. Math., 2020
2019
2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles.
SIAM J. Discret. Math., 2019
A note on chromatic number of (cap, even hole)-free graphs.
Discret. Math., 2019
Bisections of graphs without K2, l.
Discret. Appl. Math., 2019
2018
Thickness and outerthickness for embedded graphs.
Discret. Math., 2018
2017
2-Distance coloring of planar graphs with girth 5.
J. Comb. Optim., 2017
On partitions of graphs under degree constraints.
Discret. Appl. Math., 2017
A Note on Chromatic Number and Induced Odd Cycles.
Electron. J. Comb., 2017
Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles.
Ars Comb., 2017
2016
On judicious partitions of graphs.
J. Comb. Optim., 2016
2015
Cyclic 9-coloring of plane graphs with maximum face degree six.
Ars Comb., 2015
2014
Aperiodic Disturbance Rejection in Repetitive-Control Systems.
IEEE Trans. Control. Syst. Technol., 2014
Forbidden Subgraphs and 3-Colorings.
SIAM J. Discret. Math., 2014
On judicious bisections of graphs.
J. Comb. Theory B, 2014
On minimum balanced bipartitions of triangle-free graphs.
J. Comb. Optim., 2014
Maximum Balanced 3-Partitions of graphs.
Discret. Math. Algorithms Appl., 2014
2013
On the complexity of injective colorings and its generalizations.
Theor. Comput. Sci., 2013
On Some Properties of Cages.
Ars Comb., 2013
2012
Design of discrete-time repetitive control system based on two-dimensionalmodel.
Int. J. Autom. Comput., 2012
Maximum Directed Cuts in Graphs with Degree Constraints.
Graphs Comb., 2012
Injective choosability of planar graphs of girth five and six.
Discret. Math., 2012
Upper bounds on minimum balanced bipartitions.
Discret. Math., 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
Better Bounds for <i>k</i>-Partitions of Graphs.
Comb. Probab. Comput., 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
Balanced judicious bipartitions of graphs.
J. Graph Theory, 2010
Some results on acyclic edge coloring of plane graphs.
Inf. Process. Lett., 2010
A note on balanced bipartitions.
Discret. Math., 2010
A forbidden subgraph characterization of line-polar bipartite graphs.
Discret. Appl. Math., 2010
2009
Judicious k-partitions of graphs.
J. Comb. Theory B, 2009
A Note on 3-colorable Plane Graphs without 5- and 7-cycles.
Discret. Math. Algorithms Appl., 2009
On (3, 1)*-choosability of toroidal Graphs.
Discret. Math. Algorithms Appl., 2009
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles.
Discret. Math., 2009
A note on list improper coloring of plane graphs.
Discret. Appl. Math., 2009
On a bipartition problem of Bollobás and Scott.
Comb., 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
Relay sensor placement in wireless sensor networks.
Wirel. Networks, 2008
On (3, 1)<sup>*</sup>-Coloring of Plane Graphs.
SIAM J. Discret. Math., 2008
Triangle-free subcubic graphs with minimum bipartite density.
J. Comb. Theory B, 2008
On minimally circular-imperfect graphs.
Discret. Math., 2008
2007
An analogue of Dirac's theorem on circular super-critical graphs.
Eur. J. Comb., 2007
Every toroidal graph without adjacent triangles is (4, 1)<sup>*</sup>-choosable.
Discret. Appl. Math., 2007
2006
Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication.
J. Glob. Optim., 2006
On 3-colorable plane graphs without 5- and 7-cycles.
J. Comb. Theory B, 2006
Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.
Ars Comb., 2006
2005
Minimally circular-imperfect graphs with a major vertex.
Discret. Math., 2005
Decomposing toroidal graphs into circuits and edges.
Discret. Appl. Math., 2005
2002
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability.
Discret. Math., 2002
Two conjectures equivalent to the perfect graph conjecture.
Discret. Math., 2002
Hajós' conjecture and projective graphs.
Discret. Math., 2002
2001
On Structure of Some Plane Graphs with Application to Choosability.
J. Comb. Theory B, 2001
Plane Graphs with Acyclic Complex.
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
The 4-Choosability of Plane Graphs without 4-Cycles'.
J. Comb. Theory B, 1999
1998
A sufficient condition for bipartite graphs to be type one.
J. Graph Theory, 1998
On endo-homology of complexes of graphs.
Discret. Math., 1998
1996
On the fixed edge of planar graphs with minimum degree five.
Discret. Math., 1996
