default search action
Baogang Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j66]Jialei Song
, Baogang Xu:
Divisibility and coloring of some P5-free graphs. Discret. Appl. Math. 348: 144-151 (2024) - [j65]Ran Chen, Di Wu, Baogang Xu:
Structure of some ( P7, C4)-free graphs with application to colorings. Discret. Appl. Math. 357: 14-23 (2024) - [j64]Di Wu
Perfect divisibility and coloring of some fork-free graphs. Discret. Math. 347(10): 114121 (2024) - 2023
- [j63]Wei Dong, Baogang Xu, Yian Xu
A Tight Linear Bound to the Chromatic Number of $(P_5, K_1+(K_1\cup K_3))$-Free Graphs. Graphs Comb. 39(3): 43 (2023) - [j62]Di Wu
Coloring of Some Crown-Free Graphs. Graphs Comb. 39(5): 106 (2023) - [i2]Di Wu, Baogang Xu:
Perfect divisibility and coloring of some fork-free graphs. CoRR abs/2302.06800 (2023) - 2022
- [j61]Muhuo Liu
On connected partition with degree constraints. Discret. Math. 345(2): 112680 (2022) - [j60]Wei Dong, Baogang Xu, Yian Xu:
On the chromatic number of some P5-free graphs. Discret. Math. 345(10): 113004 (2022) - 2021
- [j59]Muhuo Liu
On a conjecture of Schweser and Stiebitz. Discret. Appl. Math. 295: 25-31 (2021) - [j58]Jialei Song, Baogang Xu:
Partitions of Multigraphs Without C4. Graphs Comb. 37(6): 2095-2111 (2021) - [i1]Jialei Song, Baogang Xu:
On the chromatic number of a family of odd hole free graphs. CoRR abs/2110.12710 (2021) - 2020
- [j57]Jialei Song, Baogang Xu:
Partitions of graphs and multigraphs under degree constraints. Discret. Appl. Math. 279: 134-145 (2020)
2010 – 2019
- 2019
- [j56]Jing Jin, Baogang Xu:
Bisections of graphs without K2, l. Discret. Appl. Math. 259: 112-118 (2019) - [j55]Rong Wu, Baogang Xu:
A note on chromatic number of (cap, even hole)-free graphs. Discret. Math. 342(3): 898-903 (2019) - [j54]Wei Dong, Baogang Xu:
2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles. SIAM J. Discret. Math. 33(3): 1297-1312 (2019) - 2018
- [j53]Baogang Xu, Xiaoya Zha:
Thickness and outerthickness for embedded graphs. Discret. Math. 341(6): 1688-1695 (2018) - 2017
- [j52]Jing Jin, Baogang Xu:
Edge coloring of 1-planar graphs without intersecting triangles and chordal 5-cycles. Ars Comb. 135: 71-81 (2017) - [j51]Baogang Xu, Gexin Yu, Xiaoya Zha:
A Note on Chromatic Number and Induced Odd Cycles. Electron. J. Comb. 24(4): 4 (2017) - [j50]Muhuo Liu, Baogang Xu:
On partitions of graphs under degree constraints. Discret. Appl. Math. 226: 87-93 (2017) - [j49]Wei Dong, Baogang Xu:
2-Distance coloring of planar graphs with girth 5. J. Comb. Optim. 34(4): 1302-1322 (2017) - 2016
- [j48]Muhuo Liu, Baogang Xu:
On judicious partitions of graphs. J. Comb. Optim. 31(4): 1383-1398 (2016) - 2015
- [j47]Min Wan, Baogang Xu:
Cyclic 9-coloring of plane graphs with maximum face degree six. Ars Comb. 121: 413-420 (2015) - 2014
- [j46]Haiyan Li, Baogang Xu:
Maximum Balanced 3-Partitions of graphs. Discret. Math. Algorithms Appl. 6(2) (2014) - [j45]Haiyan Li, Yanting Liang, Muhuo Liu, Baogang Xu:
On minimum balanced bipartitions of triangle-free graphs. J. Comb. Optim. 27(3): 557-566 (2014) - [j44]Baogang Xu
On judicious bisections of graphs. J. Comb. Theory B 106: 30-69 (2014) - [j43]Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu:
Forbidden Subgraphs and 3-Colorings. SIAM J. Discret. Math. 28(3): 1226-1256 (2014) - [j42]Min Wu, Baogang Xu, Weihua Cao, Jin-Hua She:
Aperiodic Disturbance Rejection in Repetitive-Control Systems. IEEE Trans. Control. Syst. Technol. 22(3): 1044-1051 (2014) - 2013
- [j41]Tao Wang, Baogang Xu, Qinglin Yu:
On Some Properties of Cages. Ars Comb. 108: 201-208 (2013) - [j40]Jing Jin, Baogang Xu, Xiaoyan Zhang:
On the complexity of injective colorings and its generalizations. Theor. Comput. Sci. 491: 119-126 (2013) - 2012
- [j39]Rui Li, Baogang Xu:
Edge choosability and total choosability of toroidal graphs without intersecting triangles. Ars Comb. 103: 109-118 (2012) - [j38]Rui Li, Baogang Xu:
On a graph partition result of Kuhn and Osthus. Ars Comb. 103: 491-495 (2012) - [j37]Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou:
Upper bounds on minimum balanced bipartitions. Discret. Math. 312(6): 1077-1083 (2012) - [j36]Rui Li, Baogang Xu:
Injective choosability of planar graphs of girth five and six. Discret. Math. 312(6): 1260-1265 (2012) - [j35]Baogang Xu, Xingxing Yu:
Maximum Directed Cuts in Graphs with Degree Constraints. Graphs Comb. 28(4): 563-574 (2012) - [j34]Song-Gui Yuan, Min Wu, Baogang Xu, Rui-Juan Liu:
Design of discrete-time repetitive control system based on two-dimensionalmodel. Int. J. Autom. Comput. 9(2): 165-170 (2012) - 2011
- [j33]Baogang Xu, Xingxing Yu:
Better Bounds for k-Partitions of Graphs. Comb. Probab. Comput. 20(4): 631-640 (2011) - [j32]Rui Li, Baogang Xu:
Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discret. Math. 311(20): 2158-2163 (2011) - [c3]Min Wu, Baogang Xu, Weihua Cao, Jin-Hua She:
Disturbance rejection in repetitive-control systems based on equivalent-input-disturbance approach. CDC/ECC 2011: 940-945 - 2010
- [j31]Jing Huang, Baogang Xu:
A forbidden subgraph characterization of line-polar bipartite graphs. Discret. Appl. Math. 158(6): 666-680 (2010) - [j30]Baogang Xu, Juan Yan, Xingxing Yu:
A note on balanced bipartitions. Discret. Math. 310(20): 2613-2617 (2010) - [j29]Wei Dong, Baogang Xu:
Some results on acyclic edge coloring of plane graphs. Inf. Process. Lett. 110(20): 887-892 (2010) - [j28]Baogang Xu, Juan Yan, Xingxing Yu:
Balanced judicious bipartitions of graphs. J. Graph Theory 63(3): 210-225 (2010)
2000 – 2009
- 2009
- [j27]Kexiang Xu, Baogang Xu:
Ordering graphs with maximum degree 3 by their indices. Ars Comb. 91 (2009) - [j26]Wei Dong, Baogang Xu:
(3, 2)*-choosability of triangle-free toroidal graphs. Ars Comb. 93 (2009) - [j25]Baogang Xu, Xingxing Yu:
On a bipartition problem of Bollobás and Scott. Comb. 29(5): 595-618 (2009) - [j24]Wei Dong, Baogang Xu:
A note on list improper coloring of plane graphs. Discret. Appl. Math. 157(2): 433-436 (2009) - [j23]Haihui Zhang, Baogang Xu:
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles. Discret. Math. 309(20): 6087-6091 (2009) - [j22]Wei Dong, Baogang Xu:
On (3, 1)*-choosability of toroidal Graphs. Discret. Math. Algorithms Appl. 1(2): 291-298 (2009) - [j21]Baogang Xu:
A Note on 3-colorable Plane Graphs without 5- and 7-cycles. Discret. Math. Algorithms Appl. 1(3): 347-354 (2009) - [j20]Baogang Xu, Xingxing Yu:
Judicious k-partitions of graphs. J. Comb. Theory B 99(2): 324-337 (2009) - 2008
- [j19]Baogang Xu:
On minimally circular-imperfect graphs. Discret. Math. 308(15): 3134-3142 (2008) - [j18]Baogang Xu, Xingxing Yu:
Triangle-free subcubic graphs with minimum bipartite density. J. Comb. Theory B 98(3): 516-537 (2008) - [j17]Baogang Xu:
On (3, 1)*-Coloring of Plane Graphs. SIAM J. Discret. Math. 23(1): 205-220 (2008) - [j16]Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang
Relay sensor placement in wireless sensor networks. Wirel. Networks 14(3): 347-355 (2008) - 2007
- [j15]Baogang Xu, Haihui Zhang:
Every toroidal graph without adjacent triangles is (4, 1)*-choosable. Discret. Appl. Math. 155(1): 74-78 (2007) - [j14]Baogang Xu:
An analogue of Dirac's theorem on circular super-critical graphs. Eur. J. Comb. 28(4): 1270-1275 (2007) - 2006
- [j13]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) - [j12]Baogang Xu:
On 3-colorable plane graphs without 5- and 7-cycles. J. Comb. Theory B 96(6): 958-963 (2006) - [j11]Ionut Cardei, Mihaela Cardei, Lusheng Wang
Optimal Relay Location for Resource-limited Energy-efficient Wireless Communication. J. Glob. Optim. 36(3): 391-399 (2006) - 2005
- [j10]Baogang Xu, Lusheng Wang
Decomposing toroidal graphs into circuits and edges. Discret. Appl. Math. 148(2): 147-159 (2005) - [j9]Baogang Xu:
Minimally circular-imperfect graphs with a major vertex. Discret. Math. 301(2-3): 239-242 (2005) - 2002
- [j8]Baogang Xu:
On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability. Discret. Math. 248(1-3): 283-291 (2002) - [j7]Genghua Fan, Baogang Xu:
Hajós' conjecture and projective graphs. Discret. Math. 252(1-3): 91-101 (2002) - [j6]Baogang Xu:
Two conjectures equivalent to the perfect graph conjecture. Discret. Math. 258(1-3): 347-351 (2002) - 2001
- [j5]Peter Che Bor Lam, Wai Chee Shiu, Baogang Xu:
On Structure of Some Plane Graphs with Application to Choosability. J. Comb. Theory B 82(2): 285-296 (2001) - [c2]Baogang Xu:
Plane Graphs with Acyclic Complex. COCOON 2001: 395-399 - [c1]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
1990 – 1999
- 1999
- [j4]Peter Che Bor Lam, Baogang Xu, Jiazhuang Liu:
The 4-Choosability of Plane Graphs without 4-Cycles'. J. Comb. Theory B 76(1): 117-126 (1999) - 1998
- [j3]Litong Xie, Guizhen Liu, Baogang Xu:
On endo-homology of complexes of graphs. Discret. Math. 188(1-3): 285-291 (1998) - [j2]Baogang Xu:
A sufficient condition for bipartite graphs to be type one. J. Graph Theory 29(3): 133-137 (1998) - 1996
- [j1]Baogang Xu, Hongbing Fan:
On the fixed edge of planar graphs with minimum degree five. Discret. Math. 152(1-3): 325-328 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-10 01:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: