The SCEAS System
| |||||||

## Search the dblp DataBase
Baogang Xu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ding-Zhu Du, Lusheng Wang, Baogang Xu
**The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points.**[Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:509-518 [Conf] - Baogang Xu
**Plane Graphs with Acyclic Complex.**[Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:395-399 [Conf] - Baogang Xu, Lusheng Wang
**Decomposing toroidal graphs into circuits and edges.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:148, n:2, pp:147-159 [Journal] - Baogang Xu, Haihui Zhang
**Every toroidal graph without adjacent triangles is (4, 1)**[Citation Graph (0, 0)][DBLP]^{*}-choosable. Discrete Applied Mathematics, 2007, v:155, n:1, pp:74-78 [Journal] - Genghua Fan, Baogang Xu
**Hajós' conjecture and projective graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:252, n:1-3, pp:91-101 [Journal] - Baogang Xu
**Two conjectures equivalent to the perfect graph conjecture.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:258, n:1-3, pp:347-351 [Journal] - Baogang Xu
**On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:248, n:1-3, pp:283-291 [Journal] - Baogang Xu
**Minimally circular-imperfect graphs with a major vertex.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:301, n:2-3, pp:239-242 [Journal] - Baogang Xu
**An analogue of Dirac's theorem on circular super-critical graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2007, v:28, n:4, pp:1270-1275 [Journal] - Peter Che Bor Lam, Wai Chee Shiu, Baogang Xu
**On Structure of Some Plane Graphs with Application to Choosability.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:285-296 [Journal] - Peter Che Bor Lam, Baogang Xu, Jiazhuang Liu
**The 4-Choosability of Plane Graphs without 4-Cycles'.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1999, v:76, n:1, pp:117-126 [Journal] - Baogang Xu
**On 3-colorable plane graphs without 5- and 7-cycles.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:958-963 [Journal] - Litong Xie, Guizhen Liu, Baogang Xu
**On endo-homology of complexes of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:188, n:1-3, pp:285-291 [Journal] - Baogang Xu, Hongbing Fan
**On the fixed edge of planar graphs with minimum degree five.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:152, n:1-3, pp:325-328 [Journal] **Every Plane Graph with Girth at least 4 without 8- and 9-circuits is 3-Choosable.**[Citation Graph (, )][DBLP]**A note on list improper coloring of plane graphs.**[Citation Graph (, )][DBLP]**A forbidden subgraph characterization of line-polar bipartite graphs.**[Citation Graph (, )][DBLP]**On minimally circular-imperfect graphs.**[Citation Graph (, )][DBLP]**Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles.**[Citation Graph (, )][DBLP]**A note on balanced bipartitions.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |