 | 2009 |
|---|
| 20 |       | Wei Dong,
Baogang Xu:
A note on list improper coloring of plane graphs.
Discrete Applied Mathematics 157(2): 433-436 (2009) |
| 19 | | Baogang Xu,
Xingxing Yu:
Judicious k-partitions of graphs.
J. Comb. Theory, Ser. B 99(2): 324-337 (2009) |
| 2008 |
|---|
| 18 | | Baogang Xu:
On minimally circular-imperfect graphs.
Discrete Mathematics 308(15): 3134-3142 (2008) |
| 17 | | Baogang Xu,
Xingxing Yu:
Triangle-free subcubic graphs with minimum bipartite density.
J. Comb. Theory, Ser. B 98(3): 516-537 (2008) |
| 16 | | Xiuzhen Cheng,
Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
Relay sensor placement in wireless sensor networks.
Wireless Networks 14(3): 347-355 (2008) |
| 2007 |
|---|
| 15 | | Baogang Xu,
Haihui Zhang:
Every toroidal graph without adjacent triangles is (4, 1)*-choosable.
Discrete Applied Mathematics 155(1): 74-78 (2007) |
| 14 | | Baogang Xu:
An analogue of Dirac's theorem on circular super-critical graphs.
Eur. J. Comb. 28(4): 1270-1275 (2007) |
| 2006 |
|---|
| 13 |  | Haihui Zhang,
Baogang Xu,
Zhiren Sun:
Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.
Ars Comb. 80: (2006) |
| 12 | | Baogang Xu:
On 3-colorable plane graphs without 5- and 7-cycles.
J. Comb. Theory, Ser. B 96(6): 958-963 (2006) |
| 2005 |
|---|
| 11 | | Baogang Xu,
Lusheng Wang:
Decomposing toroidal graphs into circuits and edges.
Discrete Applied Mathematics 148(2): 147-159 (2005) |
| 10 | | Baogang Xu:
Minimally circular-imperfect graphs with a major vertex.
Discrete Mathematics 301(2-3): 239-242 (2005) |
| 2002 |
|---|
| 9 | | Baogang Xu:
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability.
Discrete Mathematics 248(1-3): 283-291 (2002) |
| 8 | | Genghua Fan,
Baogang Xu:
Hajós' conjecture and projective graphs.
Discrete Mathematics 252(1-3): 91-101 (2002) |
| 7 | | Baogang Xu:
Two conjectures equivalent to the perfect graph conjecture.
Discrete Mathematics 258(1-3): 347-351 (2002) |
| 2001 |
|---|
| 6 | | Baogang Xu:
Plane Graphs with Acyclic Complex.
COCOON 2001: 395-399 |
| 5 | | Ding-Zhu Du,
Lusheng Wang,
Baogang Xu:
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.
COCOON 2001: 509-518 |
| 4 | | Peter Che Bor Lam,
Wai Chee Shiu,
Baogang Xu:
On Structure of Some Plane Graphs with Application to Choosability.
J. Comb. Theory, Ser. B 82(2): 285-296 (2001) |
| 1999 |
|---|
| 3 | | Peter Che Bor Lam,
Baogang Xu,
Jiazhuang Liu:
The 4-Choosability of Plane Graphs without 4-Cycles'.
J. Comb. Theory, Ser. B 76(1): 117-126 (1999) |
| 1998 |
|---|
| 2 | | Litong Xie,
Guizhen Liu,
Baogang Xu:
On endo-homology of complexes of graphs.
Discrete Mathematics 188(1-3): 285-291 (1998) |
| 1996 |
|---|
| 1 | | Baogang Xu,
Hongbing Fan:
On the fixed edge of planar graphs with minimum degree five.
Discrete Mathematics 152(1-3): 325-328 (1996) |
