Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorman L. Biggs
Person information
- affiliation: London School of Economics and Political Science, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2017
[j22]Norman Biggs:
Chromatic polynomials and toroidal graphs. Australas. J Comb. 67: 235-242 (2017)- 2015
- [j21]Frans J. C. T. de Ruiter, Norman L. Biggs:
Applications of Integer Programming Methods to Cages. Electron. J. Comb. 22(4): 4 (2015) - 2007
- [j20]Norman Biggs:
Topics in Algebraic Graph Theory, by Lowell W. Beineke and Robin J. Wilson (Academic Consultant: Peter J. Cameron), Encyclopedia of Mathematics and its Applications 102, CUP 2005, 257pp., GBP 50.00/$95.00. Comb. Probab. Comput. 16(1): 171-172 (2007) - 2004
- [j19]Norman L. Biggs, Mikhail H. Klin, P. Reinfeld:
Algebraic methods for chromatic polynomials. Eur. J. Comb. 25(2): 147-160 (2004) - [j18]Norman Biggs:
Specht modules and chromatic polynomials. J. Comb. Theory, Ser. B 92(2): 359-377 (2004) - 2002
- [j17]Norman Biggs:
Equimodular curves. Discret. Math. 259(1-3): 37-57 (2002) - 2001
- [j16]Norman Biggs:
A Matrix Method for Chromatic Polynomials. J. Comb. Theory, Ser. B 82(1): 19-29 (2001) - 1998
- [j15]Norman Biggs:
Constructions for Cubic Graphs with Large Girth. Electron. J. Comb. 5 (1998) - 1994
- [j14]Norman Biggs:
Combinatorics and connectionism. Discret. Math. 124(1-3): 19-36 (1994) - 1993
- [j13]Norman L. Biggs:
Potential Thory on Distance-Regular Graphs. Comb. Probab. Comput. 2: 243-255 (1993) - [j12]John Shawe-Taylor
, Martin Anthony, Norman Biggs:
Bounding Sample Size with the Vapnik-Chervonenkis Dimension. Discret. Appl. Math. 42(1): 65-73 (1993) - [j11]Martin Anthony, Norman Biggs:
The mean chromatic number of paths and cycles. Discret. Math. 120(1-3): 227-231 (1993) - 1990
- [j10]Norman L. Biggs, A. G. Boshier:
Note on the girth of Ramanujan graphs. J. Comb. Theory, Ser. B 49(2): 190-194 (1990) - 1989
- [j9]Norman Biggs:
Confluence of some presentations associated with graphs. Discret. Math. 75(1-3): 41-46 (1989) - [j8]Norman L. Biggs:
A proof of Serre's theorem. Discret. Math. 78(1-2): 55-57 (1989) - [j7]Donald G. Beane, Norman L. Biggs, Brian J. Wilson:
The growth rate of the harmonious chromatic number. J. Graph Theory 13(3): 291-299 (1989) - 1988
- [j6]Norman Biggs:
Girth and residual finiteness. Comb. 8(4): 307-312 (1988) - 1985
- [j5]Norman L. Biggs, S. K. Burford:
Infinite coverings of cages. Eur. J. Comb. 6(1): 7-12 (1985) - 1983
- [j4]Norman Biggs, M. L. Hoare:
The sextet construction for cubic graphs. Comb. 3(2): 153-165 (1983) - 1982
- [j3]Norman L. Biggs:
A new 5-arc-transitive cubic graph. J. Graph Theory 6(4): 447-451 (1982) - 1980
- [j2]Norman L. Biggs, M. J. Hoare:
A trivalent graph with 58 vertices and girth 9. Discret. Math. 30(3): 299-301 (1980) - 1973
- [j1]Norman Biggs:
Expansions of the chromatic polynomial. Discret. Math. 6(2): 105-113 (1973)
Conference and Workshop Papers
- 1990
- [c1]Martin Anthony, Norman Biggs, John Shawe-Taylor:
The Learnability of Formal Concepts. COLT 1990: 246-257
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 2023-09-27 22:52 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:
