
Search the dblp DataBase
Gerd Fricke:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs
Independence and Irredundance in kRegular Graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:49, n:, pp: [Journal]
 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:241258 [Journal]
 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:267277 [Journal]
 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:12, pp:8591 [Journal]
 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:13, pp:131147 [Journal]
 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:4147 [Journal]
 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:13, pp:221225 [Journal]
 Ernest J. Cockayne, Gerd Fricke, Christina M. Mynhardt
On a NordhausGaddum type problem for independent domination. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:138, n:13, pp:199205 [Journal]
On the computational complexity of upper fractional domination. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
