default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Staton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j15]John W. Estes, William Staton, Bing Wei
:
A bound on the values of independence polynomials at -1/k-1/k for kk-degenerate graphs. Discret. Math. 313(18): 1793-1798 (2013)- 2012
- [j14]John W. Estes, William Staton:
Diatonic Graphs. Ars Comb. 105: 333-354 (2012) - [j13]Lanzhen Song, William Staton, Bing Wei:
Independence polynomials of some compound graphs. Discret. Appl. Math. 160(4-5): 657-663 (2012) - 2010
- [j12]Lanzhen Song, William Staton, Bing Wei:
Independence polynomials of k-tree related graphs. Discret. Appl. Math. 158(8): 943-950 (2010) - 2009
- [j11]Alice Steimle, William Staton:
The isomorphism classes of the generalized Petersen graphs. Discret. Math. 309(1): 231-237 (2009) - 2005
- [j10]Connie Maude Campbell, William Staton:
A Square-Packing Problem of Erdős. Am. Math. Mon. 112(2): 165-167 (2005) - 1999
- [j9]Asad Ali Ali, William Staton:
The Extremal Question for Cycles with Chords. Ars Comb. 51 (1999) - 1996
- [j8]Asad Ali Ali, William Staton:
On Extremal Graphs With No Long Paths. Electron. J. Comb. 3(1) (1996) - [j7]Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton:
Sizes of graphs with induced subgraphs of large maximum degree. Discret. Math. 158(1-3): 283-286 (1996) - [j6]Guantao Chen, Paul Erdös, William Staton:
Proof of a Conjecture of Bollob's on Nested Cycles. J. Comb. Theory B 66(1): 38-43 (1996) - 1995
- [j5]Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton:
Degree sequence and independence in K(4)-free graphs. Discret. Math. 141(1-3): 285-290 (1995) - 1991
- [j4]Paul Erdös, Siemion Fajtlowicz, William Staton:
Degree sequences in triangle-free graphs. Discret. Math. 92(1-3): 85-88 (1991) - 1985
- [j3]Glenn Hopkins, William Staton:
Graphs with unique maximum independent sets. Discret. Math. 57(3): 245-251 (1985) - 1984
- [j2]William Staton:
Induced forests in cubic graphs. Discret. Math. 49(2): 175-178 (1984) - 1982
- [j1]Glenn Hopkins, William Staton:
Extremal bipartite subgraphs of cubic triangle-free graphs. J. Graph Theory 6(2): 115-121 (1982)
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 2025-01-09 13:24 CET 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:
