default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheng Bau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j16]Sheng Bau, Peter Dankelmann
:
Diameter of orientations of graphs with given minimum degree. Eur. J. Comb. 49: 126-133 (2015)- [j15]Sheng Bau, Naoki Matsumoto, Atsuhiro Nakamoto, Lijuan Zheng:
Minor Relations for Quadrangulations on the Sphere. Graphs Comb. 31(6): 2029-2036 (2015) - [j14]Sheng Bau, Benjamin van Niekerk, David White:
An Intermediate Value Theorem for the Decycling Numbers of Toeplitz Graphs. Graphs Comb. 31(6): 2037-2042 (2015)
2000 – 2009
- 2007
- [j13]Sheng Bau, Akira Saito:
Reduction for 3-Connected Graphs of Minimum Degree at Least Four. Graphs Comb. 23(Supplement-1): 135-144 (2007) - 2005
- [j12]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau:
Mutually independent hamiltonian paths in star networks. Networks 46(2): 110-117 (2005) - 2003
- [j11]Sheng Bau, Michael A. Henning, Peter Dankelmann:
Average lower independence in trees and outerplanar graphs. Ars Comb. 69 (2003) - [j10]Sheng Bau, Michael A. Henning:
Matching transformation graphs of cubic bipartite plane graphs. Discret. Math. 262(1-3): 27-36 (2003) - 2002
- [j9]Sheng Bau, Lowell W. Beineke:
The decycling number of graphs. Australas. J Comb. 25: 285-298 (2002) - [j8]Sheng Bau:
Cycles with Prescribed and Forbidden Sets of Elements in Cubic Graphs. Graphs Comb. 18(2): 201-208 (2002) - [j7]Sheng Bau, Nicholas C. Wormald, Sanming Zhou:
Decycling numbers of random regular graphs. Random Struct. Algorithms 21(3-4): 397-413 (2002) - 2001
- [j6]Sheng Bau:
The Connectivity of Matching Transformation Graphs of Cubic Bipartite Plane Graphs. Ars Comb. 60 (2001) - 2000
- [j5]Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay:
Nonhamiltonian 3-Connected Cubic Planar Graphs. SIAM J. Discret. Math. 13(1): 25-32 (2000)
1990 – 1999
- 1999
- [j4]Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay:
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. Graphs Comb. 15(4): 373-376 (1999) - 1991
- [j3]Sheng Bau, Derek A. Holton:
Cycles containing 12 vertices in 3-connected cubic graphs. J. Graph Theory 15(4): 421-429 (1991) - 1990
- [j2]Sheng Bau:
Cycles containing a set of elements in cubic graphs. Australas. J Comb. 2: 57-76 (1990)
1980 – 1989
- 1988
- [j1]Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Gordon F. Royle:
An 11-vertex theorem for 3-connected cubic graphs. J. Graph Theory 12(4): 561-570 (1988)
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-05 20:25 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:
