Peter D. Johnson Jr.

According to our database, Peter D. Johnson Jr. authored at least 38 papers between 1982 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Self-colorings of graphs.

Joseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.

Bull. ICA, 2023

Detecting Swarm Degradation: Measuring Human and Machine Performance.

August A. Capiola, Peter D. Johnson Jr., Izz Aldin Hamdan, Joseph B. Lyons, Elizabeth Fox

Proceedings of the Virtual, Augmented and Mixed Reality, 2023

2020

Closed-neighborhood union-closed graphs.

Kelly Guest, Sarah H. Holliday, Peter D. Johnson Jr., Dieter Rautenbach, Matthew Walsh

Australas. J Comb., 2020

2019

On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs.

Dean Hoffman, Paul Horn, Peter D. Johnson Jr., Andrew Owens

Graphs Comb., 2019

2018

Edge Grundy numbers of the regular Turán graphs.

Matthew DeVilbiss, Peter D. Johnson Jr., Ryan Matzke

Bull. ICA, 2018

2017

Theta Graphs are Hall t-chromatic for all t=0,1,2,...

Sarah Allred, Peter D. Johnson Jr.

Bull. ICA, 2017

Connected minimum secure-dominating sets in grids.

Johnathan Barnett, Adam Blumenthal, Peter D. Johnson Jr., Cadavious Jones, Ryan Matzke, Egbert Mujuni

AKCE Int. J. Graphs Comb., 2017

2015

Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.

Julian A. Allagan, Peter D. Johnson Jr.

Ars Comb., 2015

2012

Integer and fractional security in graphs.

Garth Isaak, Peter D. Johnson Jr., Caleb Petrie

Discret. Appl. Math., 2012

Some Extremal Problems for Edge-Regular Graphs.

Kris Coolsaet, Peter D. Johnson Jr., Kenneth J. Roblee, Tom D. Smotzer

Ars Comb., 2012

2011

The connected hub number and the connected domination number.

Peter D. Johnson Jr., Peter Slater, Matt Walsh

Networks, 2011

Completing partial latin squares: Cropper's question.

B. B. Bobga, John L. Goldwasser, Anthony J. W. Hilton, Peter D. Johnson Jr.

Australas. J Comb., 2011

2010

List multicoloring problems involving the <i>k</i>-fold Hall numbers.

Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel

J. Graph Theory, 2010

2009

The fractional chromatic number, the Hall ratio, and the lexicographic product.

Peter D. Johnson Jr.

Discret. Math., 2009

2008

The Shields-Harary numbers of K_{m, n} for continuous concave cost functions vanishing at 1.

John Holliday, Peter D. Johnson Jr.

Discret. Appl. Math., 2008

Fractional inverse and inverse fractional domination.

Peter D. Johnson Jr., Matt Walsh

Ars Comb., 2008

2007

List multicolorings of graphs with measurable sets.

Anthony J. W. Hilton, Peter D. Johnson Jr.

J. Graph Theory, 2007

Extending Hall's Theorem into List Colorings: A Partial History.

Dean G. Hoffman, Peter D. Johnson Jr.

Int. J. Math. Math. Sci., 2007

2005

Generating Huffman sequences.

Dean Hoffman, Peter D. Johnson Jr., Nadine Wilson

J. Algorithms, 2005

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs.

Peter D. Johnson Jr., R. N. Mohapatra

Int. J. Math. Math. Sci., 2005

Problems on Hall t-chromaticity.

Matthew M. Cropper, Peter D. Johnson Jr.

Ars Comb., 2005

2003

The structure of (<i>t, r</i>)-regular graphs of large order.

Robert E. Jamison, Peter D. Johnson Jr.

Discret. Math., 2003

2002

Coloring the Vertices of a Graph With Measurable Sets in a Probability Space.

Peter D. Johnson Jr., Christopher A. Rodger

Electron. Notes Discret. Math., 2002

Hall's condition for list-coloring, and the Hall parameters: recent developments.

Peter D. Johnson Jr.

Discret. Math., 2002

Which Graphs Have Hall Number Two?

Peter D. Johnson Jr., Evan B. Wantland

Ars Comb., 2002

On an extremal subfamily of an extremal family of nearly strongly regular graphs.

Peter D. Johnson Jr., Kenneth J. Roblee

Australas. J Comb., 2002

2001

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs.

Amir Daneshgar, Anthony J. W. Hilton, Peter D. Johnson Jr.

Discret. Math., 2001

2000

Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs.

Matthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.

J. Graph Theory, 2000

Progress on the Hall-Number-Two problem.

Changiz Eslahchi, Anthony J. W. Hilton, Peter D. Johnson Jr.

Australas. J Comb., 2000

1999

The Hall Number, the Hall Index, and the Total Hall Number of a Graph.

Anthony J. W. Hilton, Peter D. Johnson Jr.

Discret. Appl. Math., 1999

1996

Thwart numbers of some bipartite graphs.

Dean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland

Australas. J Comb., 1996

1990

Two-colorings of a dense subgroup of Qⁿ that forbid many distances.

Peter D. Johnson Jr.

Discret. Math., 1990

1988

Reverse class critical multigraphs.

Anthony J. W. Hilton, Peter D. Johnson Jr.

Discret. Math., 1988

1987

Another Extremal Property of Some Turan Graphs.

Christopher S. Edwards, Peter D. Johnson Jr., Zsolt Tuza

Eur. J. Comb., 1987

1986

Compatible additive permutations of finite integral bases.

Peter D. Johnson Jr., Douglas G. Rogers

Graphs Comb., 1986

Inequalities Relating Degrees of Adjacent Vertices to the Average Degree.

Peter D. Johnson Jr., R. L. Perry

Eur. J. Comb., 1986

1984

Simple product colorings.

Peter D. Johnson Jr.

Discret. Math., 1984

1982

Coloring abelian groups.

Peter D. Johnson Jr.

Discret. Math., 1982