Peter D. Johnson Jr. - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2023

Self-colorings of graphsJoseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.. bullica, 97:106-116, 2023. [doi]

Detecting Swarm Degradation: Measuring Human and Machine PerformanceAugust A. Capiola, Peter D. Johnson Jr., Izz Aldin Hamdan, Joseph B. Lyons, Elizabeth Fox. hci 2023: 325-343 [doi]

2011

Completing partial latin squares: Cropper's questionB. B. Bobga, John L. Goldwasser, Anthony J. W. Hilton, Peter D. Johnson Jr.. ajc, 49:127-152, 2011. [doi]

The connected hub number and the connected domination numberPeter D. Johnson Jr., Peter Slater, Matt Walsh. networks, 58(3):232-237, 2011. [doi]

2010

List multicoloring problems involving the ::::k::::-fold Hall numbersMathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel. jgt, 65(1):16-34, 2010. [doi]

2008

Fractional inverse and inverse fractional dominationPeter D. Johnson Jr., Matt Walsh. arscom, 87, 2008.

2007

List multicolorings of graphs with measurable setsAnthony J. W. Hilton, Peter D. Johnson Jr.. jgt, 54(3):179-193, 2007. [doi]

Extending Hall s Theorem into List Colorings: A Partial HistoryD. G. Hoffman, Peter D. Johnson Jr.. ijmmsc, 2007, 2007. [doi]

2005

Problems on Hall t-chromaticityMatthew M. Cropper, Peter D. Johnson Jr.. arscom, 76, 2005.

Coloring the vertices of a graph with measurable sets in a probability spacePeter D. Johnson Jr., Christopher A. Rodger. ejc, 26(2):251-257, 2005. [doi]

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphsPeter D. Johnson Jr., R. N. Mohapatra. ijmmsc, 2005(21):3419-3426, 2005. [doi]

2003

The structure of (::::t, r::::)-regular graphs of large orderRobert E. Jamison, Peter D. Johnson Jr.. DM, 272(2-3):297-300, 2003. [doi]

2002

Coloring the Vertices of a Graph With Measurable Sets in a Probability SpacePeter D. Johnson Jr., Christopher A. Rodger. endm, 11:417-424, 2002. [doi]

Which Graphs Have Hall Number Two?Peter D. Johnson Jr., Evan B. Wantland. arscom, 65, 2002.

Hall s condition for list-coloring, and the Hall parameters: recent developmentsPeter D. Johnson Jr.. DM, 249(1-3):135-147, 2002. [doi]

On an extremal subfamily of an extremal family of nearly strongly regular graphsPeter D. Johnson Jr., Kenneth J. Roblee. ajc, 25:279-284, 2002. [doi]

2001

Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphsA. Daneshgar, Anthony J. W. Hilton, Peter D. Johnson Jr.. DM, 241(1-3):189-199, 2001. [doi]

2000

Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphsMatthew M. Cropper, John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Peter D. Johnson Jr.. jgt, 33(4):199-219, 2000. [doi]

Progress on the Hall-Number-Two problemChangiz Eslahchi, Anthony J. W. Hilton, Peter D. Johnson Jr.. ajc, 21:211-236, 2000. [doi]

1999

The Hall Number, the Hall Index, and the Total Hall Number of a GraphAnthony J. W. Hilton, Peter D. Johnson Jr.. DAM, 94(1-3):227-245, 1999. [doi]

1996

Thwart numbers of some bipartite graphsDean G. Hoffman, Peter D. Johnson Jr., Evan B. Wantland. ajc, 13:247-258, 1996. [doi]

1986

Inequalities Relating Degrees of Adjacent Vertices to the Average DegreePeter D. Johnson Jr., R. L. Perry. ejc, 7(3):237-241, 1986. [doi]

Sign in or sign up to see more results.

runs on WebDSL