default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter D. Johnson Jr.
Person information
- affiliation: Auburn University, Department of Mathematics and Statistics, Auburn, AL, USA
- affiliation (former): University of Reading, Department of Mathematics, Reading, UK
Other persons with a similar name
- Peter Barbrook-Johnson (aka: Pete Barbrook-Johnson)
- A. Peter Johnson
- Peter Johnson — disambiguation page
- Peter Johnson 0001 — University of Bath, UK (and 1 more)
- Peter C. Johnson 0001 — Middlebury College, VT, USA (and 1 more)
- Peter D. Johnson 0001 — Stanford University School of Medicine, CA, USA
- Peter D. Johnson 0002
![[0000-0003-3470-1246]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-3470-1246")
— Dartmouth College, Department of Physics and Astronomy, Hanover, NH, USA - Peter A. Johnson 0003 — University of Waterloo, Department of Geography and Environmental Management, ON, Canada
- Peter Johnson 0008 — Unisys, Blue Bell, PA, USA
- Peter Johnson 0010 (aka: Peter A. Johnson 0001) — Clarkson University, Potsdam, NY, USA (and 1 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j38]Joseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.:
Self-colorings of graphs. Bull. ICA 97: 106-116 (2023)- [c1]August A. Capiola, Peter D. Johnson Jr., Izz Aldin Hamdan, Joseph B. Lyons, Elizabeth Fox:
Detecting Swarm Degradation: Measuring Human and Machine Performance. HCI (17) 2023: 325-343 - 2020
- [j37]Kelly Guest, Sarah H. Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh:
Closed-neighborhood union-closed graphs. Australas. J Comb. 77: 144-156 (2020)
2010 – 2019
- 2019
- [j36]Dean Hoffman, Paul Horn, Peter D. Johnson Jr., Andrew Owens:
On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs. Graphs Comb. 35(6): 1585-1596 (2019) - 2018
- [j35]Matthew DeVilbiss, Peter D. Johnson Jr., Ryan Matzke:
Edge Grundy numbers of the regular Turán graphs. Bull. ICA 84: 45-52 (2018) - 2017
- [j34]Johnathan Barnett, Adam Blumenthal, Peter D. Johnson Jr., Cadavious Jones, Ryan Matzke, Egbert Mujuni:
Connected minimum secure-dominating sets in grids. AKCE Int. J. Graphs Comb. 14(3): 216-223 (2017) - [j33]Sarah Allred, Peter D. Johnson Jr.:
Theta Graphs are Hall t-chromatic for all t=0,1,2,... Bull. ICA 81: 52-62 (2017) - 2015
- [j32]Julian A. Allagan, Peter D. Johnson Jr.:
Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs. Ars Comb. 119: 167-176 (2015) - 2012
- [j31]Kris Coolsaet, Peter D. Johnson Jr., Kenneth J. Roblee, Tom D. Smotzer:
Some Extremal Problems for Edge-Regular Graphs. Ars Comb. 105: 411-418 (2012) - [j30]Garth Isaak, Peter D. Johnson Jr., Caleb Petrie:
Integer and fractional security in graphs. Discret. Appl. Math. 160(13-14): 2060-2062 (2012) - 2011
- [j29]B. B. Bobga, John L. Goldwasser, Anthony J. W. Hilton, Peter D. Johnson Jr.:
Completing partial latin squares: Cropper's question. Australas. J Comb. 49: 127-152 (2011) - [j28]Peter D. Johnson Jr., Peter Slater, Matt Walsh:
The connected hub number and the connected domination number. Networks 58(3): 232-237 (2011) - 2010
- [j27]Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel:
List multicoloring problems involving the k-fold Hall numbers. J. Graph Theory 65(1): 16-34 (2010)
2000 – 2009
- 2009
- [j26]Peter D. Johnson Jr.:
The fractional chromatic number, the Hall ratio, and the lexicographic product. Discret. Math. 309(14): 4746-4749 (2009) - 2008
- [j25]Peter D. Johnson Jr., Matt Walsh:
Fractional inverse and inverse fractional domination. Ars Comb. 87 (2008) - [j24]John Holliday, Peter D. Johnson Jr.:
The Shields-Harary numbers of Km, n for continuous concave cost functions vanishing at 1. Discret. Appl. Math. 156(1): 82-87 (2008) - 2007
- [j23]Dean G. Hoffman, Peter D. Johnson Jr.:
Extending Hall's Theorem into List Colorings: A Partial History. Int. J. Math. Math. Sci. 2007: 72168:1-72168:17 (2007) - [j22]Anthony J. W. Hilton, Peter D. Johnson Jr.:
List multicolorings of graphs with measurable sets. J. Graph Theory 54(3): 179-193 (2007) - 2005
- [j21]Matthew M. Cropper, Peter D. Johnson Jr.:
Problems on Hall t-chromaticity. Ars Comb. 76 (2005) - [j20]Peter D. Johnson Jr., Christopher A. Rodger:
Coloring the vertices of a graph with measurable sets in a probability space. Eur. J. Comb. 26(2): 251-257 (2005) - [j19]Peter D. Johnson Jr., R. N. Mohapatra:
A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs. Int. J. Math. Math. Sci. 2005(21): 3419-3426 (2005) - [j18]Dean Hoffman, Peter D. Johnson Jr., Nadine Wilson:
Generating Huffman sequences. J. Algorithms 54(1): 115-121 (2005) - 2003
- [j17]Robert E. Jamison, Peter D. Johnson Jr.:
The structure of (t, r)-regular graphs of large order. Discret. Math. 272(2-3): 297-300 (2003) - 2002
- [j16]Peter D. Johnson Jr., Kenneth J. Roblee:
On an extremal subfamily of an extremal family of nearly strongly regular graphs. Australas. J Comb. 25: 279-284 (2002) - [j15]Peter D. Johnson Jr., Evan B. Wantland:
Which Graphs Have Hall Number Two? Ars Comb. 65 (2002) - [j14]Peter D. Johnson Jr.:
Hall's condition for list-coloring, and the Hall parameters: recent developments. Discret. Math. 249(1-3): 135-147 (2002) - [j13]Peter D. Johnson Jr., Christopher A. Rodger:
Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. Electron. Notes Discret. Math. 11: 417-424 (2002) - 2001
- [j12]Amir Daneshgar, Anthony J. W. Hilton, Peter D. Johnson Jr.:
Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs. Discret. Math. 241(1-3): 189-199 (2001) - 2000
- [j11]Changiz Eslahchi, Anthony J. W. Hilton, Peter D. Johnson Jr.:
Progress on the Hall-Number-Two problem. Australas. J Comb. 21: 211-236 (2000) - [j10]Matthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.:
Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs. J. Graph Theory 33(4): 199-219 (2000)
1990 – 1999
- 1999
- [j9]Anthony J. W. Hilton, Peter D. Johnson Jr.:
The Hall Number, the Hall Index, and the Total Hall Number of a Graph. Discret. Appl. Math. 94(1-3): 227-245 (1999) - 1996
- [j8]Dean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland:
Thwart numbers of some bipartite graphs. Australas. J Comb. 13: 247-258 (1996) - 1990
- [j7]Peter D. Johnson Jr.:
Two-colorings of a dense subgroup of Qn that forbid many distances. Discret. Math. 79(2): 191-195 (1990)
1980 – 1989
- 1988
- [j6]Anthony J. W. Hilton, Peter D. Johnson Jr.:
Reverse class critical multigraphs. Discret. Math. 69(3): 309-311 (1988) - 1987
- [j5]Christopher S. Edwards, Peter D. Johnson Jr., Zsolt Tuza:
Another Extremal Property of Some Turan Graphs. Eur. J. Comb. 8(1): 27-28 (1987) - 1986
- [j4]Peter D. Johnson Jr., R. L. Perry:
Inequalities Relating Degrees of Adjacent Vertices to the Average Degree. Eur. J. Comb. 7(3): 237-241 (1986) - [j3]Peter D. Johnson Jr., Douglas G. Rogers:
Compatible additive permutations of finite integral bases. Graphs Comb. 2(1): 43-53 (1986) - 1984
- [j2]Peter D. Johnson Jr.:
Simple product colorings. Discret. Math. 48(1): 83-85 (1984) - 1982
- [j1]Peter D. Johnson Jr.:
Coloring abelian groups. Discret. Math. 40(2-3): 219-223 (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-20 23:03 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:
