![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Earl Glen Whitehead Jr.
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j19]Ronald C. Read, Earl Glen Whitehead Jr.:
A note on chain lengths and the Tutte polynomial. Discret. Math. 308(10): 1826-1829 (2008) - 2002
- [j18]Ronald C. Read, Earl Glen Whitehead Jr.:
The Tutte polynomial for homeomorphism classes of graphs. Discret. Math. 243(1-3): 267-272 (2002) - [j17]Hossein Shahmohamad, Earl Glen Whitehead Jr.:
Homeomorphs and amallamorphs of the Petersen graph. Discret. Math. 250(1-3): 281-289 (2002)
1990 – 1999
- 1999
- [j16]Ronald C. Read, Earl Glen Whitehead Jr.:
Chromatic polynomials of homeomorphism classes of graphs. Discret. Math. 204(1-3): 337-356 (1999) - 1997
- [j15]Zhi-Yi Guo, Earl Glen Whitehead Jr.:
Chromaticity of a family of K4 homeomorphs. Discret. Math. 172(1-3): 53-58 (1997) - 1993
- [j14]Nian-Zu Li, Earl Glen Whitehead Jr.:
The chromaticity of certain graphs with five triangles. Discret. Math. 122(1-3): 365-372 (1993) - 1992
- [j13]Nian-Zu Li, Earl Glen Whitehead Jr.:
The chromatic uniqueness of W10. Discret. Math. 104(2): 197-199 (1992)
1980 – 1989
- 1988
- [j12]Earl Glen Whitehead Jr.:
Chromatic polynomials of generalized trees. Discret. Math. 72(1-3): 391-393 (1988) - 1987
- [j11]Nian-Zu Li, Earl Glen Whitehead Jr., Shao-Ji Xu:
Classification of chromatically unique graphs having quadratic σ-polynomials. J. Graph Theory 11(2): 169-176 (1987) - 1985
- [j10]Earl Glen Whitehead Jr.:
Chromaticity of two-trees. J. Graph Theory 9(2): 279-284 (1985) - 1984
- [j9]Earl Glen Whitehead Jr., Lian-Chang Zhao:
Chromatic uniqueness and equivalence of K4 homeomorphs. J. Graph Theory 8(3): 355-364 (1984) - [j8]Earl Glen Whitehead Jr., Lian-Chang Zhao:
Cutpoints and the chromatic polynomial. J. Graph Theory 8(3): 371-377 (1984) - 1981
- [j7]Beatrice Loerinc, Earl Glen Whitehead Jr.:
Chromatic polynomaials for regular graphs and modified wheels. J. Comb. Theory B 31(3): 54-61 (1981)
1970 – 1979
- 1979
- [j6]Chong-Yun Chao, Earl Glen Whitehead Jr.:
Chromatically unique graphs. Discret. Math. 27(2): 171-177 (1979) - 1978
- [j5]Earl Glen Whitehead Jr.:
Stirling Number Identities from Chromatic Polynomials. J. Comb. Theory A 24(3): 314-317 (1978) - 1975
- [j4]Earl Glen Whitehead Jr.:
Difference sets and sum-free sets in groups of order 16. Discret. Math. 13(4): 399-407 (1975) - 1974
- [j3]Anne Penfold Street, Earl Glen Whitehead Jr.:
Group Ramsey Theory. J. Comb. Theory A 17(2): 219-226 (1974) - 1973
- [j2]Earl Glen Whitehead Jr.:
The ramsey number N(3, 3, 3, 3; 2). Discret. Math. 4(4): 389-396 (1973) - 1971
- [j1]Earl Glen Whitehead Jr.:
Algebraic structure of chromatic graphs associated with the ramsey number N(3, 3, 3;2). Discret. Math. 1(1): 113-114 (1971)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20: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