Search the dblp DataBase

Publications of Author

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