default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBei Niu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j7]Xin Zhang
, Huaqiang Zhang, Bei Niu, Bi Li:
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy. Theor. Comput. Sci. 905: 18-30 (2022)- [c2]Bei Niu, Xin Zhang:
An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs. AAIM 2022: 388-393 - 2021
- [j6]Bei Niu, Xin Zhang:
On (p, 1)-total labelling of some 1-planar graphs. Discuss. Math. Graph Theory 41(2): 531-558 (2021) - [j5]Bei Niu, Bi Li, Xin Zhang:
Hardness and algorithms of equitable tree-coloring problem in chordal graphs. Theor. Comput. Sci. 857: 8-15 (2021) - 2020
- [j4]Bei Niu, Xin Zhang:
Light edges in 1-planar graphs of minimum degree 3. Discret. Math. 343(2): 111664 (2020) - [j3]Bei Niu, Xin Zhang, Yuping Gao:
Equitable partition of plane graphs with independent crossings into induced forests. Discret. Math. 343(5): 111792 (2020) - [j2]Xin Zhang, Bei Niu:
Equitable partition of graphs into induced linear forests. J. Comb. Optim. 39(2): 581-588 (2020) - [c1]Bei Niu, Bi Li, Xin Zhang:
Complexity of Tree-Coloring Interval Graphs Equitably. AAIM 2020: 391-398 - [i8]Bei Niu, Bi Li, Xin Zhang:
Complexity of tree-coloring interval graphs equitably. CoRR abs/2003.03945 (2020)
2010 – 2019
- 2019
- [j1]Xin Zhang, Bei Niu, Jiguo Yu:
A Structure of 1-Planar Graph and Its Applications to Coloring Problems. Graphs Comb. 35(3): 677-688 (2019) - [i7]Xin Zhang, Bei Niu, Jiguo Yu:
A structure of 1-planar graph and its applications to coloring problems. CoRR abs/1902.08945 (2019) - [i6]Bei Niu, Xin Zhang, Yuping Gao:
Equitable partition of plane graphs with independent crossings into induced forests. CoRR abs/1903.08337 (2019) - [i5]Xin Zhang, Bei Niu, Yan Li, Bi Li:
Equitable vertex arboricity of $d$-degenerate graphs. CoRR abs/1908.05066 (2019) - [i4]Xin Zhang, Bei Niu:
Equitable tree-$O(d)$-coloring of $d$-degenerate graphs. CoRR abs/1908.05069 (2019) - [i3]Bei Niu, Xin Zhang:
Light edges in 1-planar graphs of minimum degree 3. CoRR abs/1908.05072 (2019) - [i2]Xin Zhang, Bei Niu:
Equitable partition of graphs into induced linear forests. CoRR abs/1908.05075 (2019) - 2018
- [i1]Xin Zhang, Bei Niu:
A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle. CoRR abs/1809.02799 (2018)
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-04-24 22:48 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:
