2003 |
9 | EE | Odile Favaron,
Gerd Fricke,
Dan Pritikin,
Joël Puech:
Irredundance and domination in kings graphs.
Discrete Mathematics 262(1-3): 131-147 (2003) |
1999 |
8 | EE | Gerd Fricke,
Teresa W. Haynes,
Sandra Mitchell Hedetniemi,
Stephen T. Hedetniemi,
Michael A. Henning:
On perfect neighborhood sets in graphs.
Discrete Mathematics 199(1-3): 221-225 (1999) |
1998 |
7 | | Gerd Fricke,
Stephen T. Hedetniemi,
David Pokrass Jacobs:
Independence and Irredundance in k-Regular Graphs.
Ars Comb. 49: (1998) |
1996 |
6 | EE | Gerd Fricke,
Michael A. Henning,
Ortrud Oellermann,
Henda C. Swart:
An Algorithm to Find Two Distance Domination Parameters in a Graph.
Discrete Applied Mathematics 68(1-2): 85-91 (1996) |
5 | EE | Gerd Fricke,
Stephen T. Hedetniemi,
David Pokrass Jacobs:
Maximal Irredundant Functions.
Discrete Applied Mathematics 68(3): 267-277 (1996) |
1995 |
4 | EE | Ernest J. Cockayne,
Gerd Fricke,
Christina M. Mynhardt:
On a Nordhaus-Gaddum type problem for independent domination.
Discrete Mathematics 138(1-3): 199-205 (1995) |
1994 |
3 | EE | Grant A. Cheston,
Gerd Fricke:
Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance.
Discrete Applied Mathematics 55(3): 241-258 (1994) |
2 | EE | Michael R. Fellows,
Gerd Fricke,
Stephen T. Hedetniemi,
David Pokrass Jacobs:
The Private Neighbor Cube.
SIAM J. Discrete Math. 7(1): 41-47 (1994) |
1990 |
1 | EE | Grant A. Cheston,
Gerd Fricke,
Stephen T. Hedetniemi,
David Pokrass Jacobs:
On the computational complexity of upper fractional domination.
Discrete Applied Mathematics 27(3): 195-207 (1990) |