| 2008 |
|---|
| 39 | EE | Anne Sinko,
Peter J. Slater:
Queen's domination using border squares and (A, B)-restricted domination.
Discrete Mathematics 308(20): 4822-4828 (2008) |
| 2007 |
|---|
| 38 | EE | Robert R. Rubalcaba,
Peter J. Slater:
Roman dominating influence parameters.
Discrete Mathematics 307(24): 3194-3200 (2007) |
| 2006 |
|---|
| 37 | EE | Suk Jai Seo,
Peter J. Slater:
An introduction to proper-coupled-domination in graphs.
ACM Southeast Regional Conference 2006: 265-270 |
| 36 | EE | Suk Jai Seo,
Peter J. Slater:
Competition-reachability of a graph.
Discrete Mathematics 306(6): 580-590 (2006) |
| 2005 |
|---|
| 35 | EE | Suk Jai Seo,
Peter J. Slater:
An introduction to competition-reachability of a graph.
ACM Southeast Regional Conference (1) 2005: 121-125 |
| 34 | | Teresa W. Haynes,
Michael A. Henning,
Peter J. Slater:
Trees with Equal Domination and Paired-domination Numbers.
Ars Comb. 76: (2005) |
| 2004 |
|---|
| 33 | | Peter J. Slater,
Steven J. Winters:
An Introduction to Maximum Sum Permutations of Graphs.
Ars Comb. 72: (2004) |
| 2003 |
|---|
| 32 | EE | Teresa W. Haynes,
Michael A. Henning,
Peter J. Slater:
Strong equality of domination parameters in trees.
Discrete Mathematics 260(1-3): 77-87 (2003) |
| 31 | EE | Teresa W. Haynes,
Stephen T. Hedetniemi,
Michael A. Henning,
Peter J. Slater:
H-forming sets in graphs.
Discrete Mathematics 262(1-3): 159-169 (2003) |
| 30 | EE | Gary Chartrand,
David Erwin,
Michael A. Henning,
Peter J. Slater,
Ping Zhang:
Graphs of order n with locating-chromatic number n-1.
Discrete Mathematics 269(1-3): 65-79 (2003) |
| 29 | EE | Wayne Goddard,
Michael Edwin Raines,
Peter J. Slater:
Distance and connectivity measures in permutation graphs.
Discrete Mathematics 271(1-3): 61-70 (2003) |
| 28 | EE | Khee Meng Koh,
Bock Boom Lim,
Peter J. Slater:
H-domination in graphs.
Discrete Mathematics 272(1): 97-105 (2003) |
| 2002 |
|---|
| 27 | EE | Peter J. Slater:
Fault-tolerant locating-dominating sets.
Discrete Mathematics 249(1-3): 179-189 (2002) |
| 1999 |
|---|
| 26 | | Wayne Goddard,
Ortrud Oellermann,
Peter J. Slater,
Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph.
Ars Comb. 54: (1999) |
| 25 | EE | Peter J. Slater:
A survey of sequences of central subgraphs.
Networks 34(4): 244-249 (1999) |
| 24 | EE | Christian Smart,
Peter J. Slater:
Center, median, and centroid subgraphs.
Networks 34(4): 303-311 (1999) |
| 1998 |
|---|
| 23 | EE | Ashok T. Amin,
Lane H. Clark,
Peter J. Slater:
Parity dimension for graphs.
Discrete Mathematics 187(1-3): 1-17 (1998) |
| 22 | EE | Teresa W. Haynes,
Peter J. Slater:
Paired-domination in graphs.
Networks 32(3): 199-206 (1998) |
| 1996 |
|---|
| 21 | EE | Michael A. Henning,
Peter J. Slater:
Inequalities relating domination parameters in cubic graphs.
Discrete Mathematics 158(1-3): 87-98 (1996) |
| 20 | EE | David W. Bange,
Anthony E. Barkauskas,
Linda H. Host,
Peter J. Slater:
Generalized domination and efficient domination in graphs.
Discrete Mathematics 159(1-3): 1-11 (1996) |
| 1994 |
|---|
| 19 | EE | Dana L. Grinstead,
Peter J. Slater:
A Recurrence Template for Several Parameters in Series-parallel Graphs.
Discrete Applied Mathematics 54(2-3): 151-168 (1994) |
| 1993 |
|---|
| 18 | EE | Kyle Siegrist,
Ashok T. Amin,
Peter J. Slater:
The Optimal Unicyclic Graphs for Pair-Connected Reliability.
Discrete Applied Mathematics 41(3): 235-243 (1993) |
| 17 | | Dana L. Grinstead,
Peter J. Slater,
Naveed A. Sherwani,
Nancy D. Holmes:
Efficient Edge Domination Problems in Graphs.
Inf. Process. Lett. 48(5): 221-228 (1993) |
| 1991 |
|---|
| 16 | EE | Richard A. Gibbs,
Peter J. Slater:
Distinct distance sets in a graph.
Discrete Mathematics 93(2-3): 155-165 (1991) |
| 1990 |
|---|
| 15 | EE | Dana L. Grinstead,
Peter J. Slater:
On minimum dominating sets with minimum intersection.
Discrete Mathematics 86(1-3): 239-254 (1990) |
| 1986 |
|---|
| 14 | EE | Peter J. Slater:
On k-graceful, countably infinite graphs.
Discrete Mathematics 61(2-3): 293-303 (1986) |
| 13 | | Frank Harary,
Peter J. Slater:
A Linear Algorithm for the Cutting Center of a Tree.
Inf. Process. Lett. 23(6): 317-319 (1986) |
| 1985 |
|---|
| 12 | EE | David W. Bange,
Anthony E. Barkauskas,
Peter J. Slater:
A note on similar edges and edge-unique line graphs.
J. Comb. Theory, Ser. B 38(1): 31-40 (1985) |
| 1983 |
|---|
| 11 | EE | David W. Bange,
Anthony E. Barkauskas,
Peter J. Slater:
Sequentially additive graphs.
Discrete Mathematics 44(3): 235-241 (1983) |
| 10 | EE | Peter J. Slater:
On k-graceful, locally finite graphs.
J. Comb. Theory, Ser. B 35(3): 319-322 (1983) |
| 1982 |
|---|
| 9 | | Peter J. Slater:
A Linear Algorithm for the Number of Degree Constrained Subforests of a Tree.
Inf. Process. Lett. 15(4): 186-188 (1982) |
| 1981 |
|---|
| 8 | EE | Peter J. Slater:
On k-sequential and other numbered graphs.
Discrete Mathematics 34(2): 185-193 (1981) |
| 7 | | Peter J. Slater,
Ernest J. Cockayne,
Stephen T. Hedetniemi:
Information Dissemination in Trees.
SIAM J. Comput. 10(4): 692-701 (1981) |
| 1980 |
|---|
| 6 | | Christine A. Morgan,
Peter J. Slater:
A Linear Algorithm for a Core of a Tree.
J. Algorithms 1(3): 247-258 (1980) |
| 1979 |
|---|
| 5 | EE | Ernest J. Cockayne,
Stephen T. Hedetniemi,
Peter J. Slater:
Matchings and transversals in hypergraphs, domination and independence-in trees.
J. Comb. Theory, Ser. B 26(1): 78-80 (1979) |
| 1978 |
|---|
| 4 | EE | Peter J. Slater:
Soldering and point splitting.
J. Comb. Theory, Ser. B 24(3): 338-343 (1978) |
| 3 | EE | Peter J. Slater:
A constructive characterization of trees with at least k disjoint maximum matchings.
J. Comb. Theory, Ser. B 25(3): 326-338 (1978) |
| 1976 |
|---|
| 2 | EE | Peter J. Slater:
R-Domination in Graphs.
J. ACM 23(3): 446-450 (1976) |
| 1975 |
|---|
| 1 | EE | S. E. Goodman,
Stephen T. Hedetniemi,
Peter J. Slater:
Advances on the Hamiltonian Completion Problem.
J. ACM 22(3): 352-360 (1975) |
