Discrete Mathematics, Volume 86

Volume 86, Numbers 1-3, December 1990

• Stephen T. Hedetniemi, Renu C. Laskar: Introduction. 3-9 BibTeX
• Ernest J. Cockayne:
  Chessboard domination problems. 13-20
  Electronic Edition (link) BibTeX
• Charles M. Grinstead, Bruce Hahne, David Van Stone:
  On the queen domination problem. 21-26
  Electronic Edition (link) BibTeX
• C. Berge, Pierre Duchet:
  Recent problems and results about kernels in directed graphs. 27-31
  Electronic Edition (link) BibTeX
• David P. Sumner:
  Critical concepts in domination. 33-46
  Electronic Edition (link) BibTeX
• John Frederick Fink, Michael S. Jacobson, Lael F. Kinch, John Roberts:
  The bondage number of a graph. 47-57
  Electronic Edition (link) BibTeX
• Michael S. Jacobson, Kenneth Peters:
  Chordal graphs and upper irredundance, upper domination and independence. 59-69
  Electronic Edition (link) BibTeX
• Bohdan Zelinka:
  Regular totally domatically full graphs. 71-79
  Electronic Edition (link) BibTeX
• Douglas F. Rall:
  Domatically critical and domatically full graphs. 81-87
  Electronic Edition (link) BibTeX
• Béla Bollobás, Ernest J. Cockayne, Christina M. Mynhardt:
  On generalised minimal domination parameters for paths. 89-97
  Electronic Edition (link) BibTeX
• Margaret B. Cozzens, Laura L. Kelleher:
  Dominating cliques in graphs. 101-116
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Covering all cliques of a graph. 117-126
  Electronic Edition (link) BibTeX
• Robert C. Brigham, Ronald D. Dutton:
  Factor domination in graphs. 127-136
  Electronic Edition (link) BibTeX
• E. Sampathkumar:
  The least point covering and domination numbers of a graph. 137-142
  Electronic Edition (link) BibTeX
• Derek G. Corneil, Lorna K. Stewart:
  Dominating sets in perfect graphs. 145-164
  Electronic Edition (link) BibTeX
• Brent N. Clark, Charles J. Colbourn, David S. Johnson:
  Unit disk graphs. 165-177
  Electronic Edition (link) BibTeX
• Charles J. Colbourn, Lorna K. Stewart:
  Permutation graphs: Connected domination and Steiner trees. 179-189
  Electronic Edition (link) BibTeX
• Vasek Chvátal, William Cook:
  The discipline number of a graph. 191-198
  Electronic Edition (link) BibTeX
• James McHugh, Yehoshua Perl:
  Best location of service centers in a treelike network under budget constraints. 199-214
  Electronic Edition (link) BibTeX
• Miroslawa Skowronska, Maciej M. Syslo:
  Dominating cycles in halin graphs. 215-224
  Electronic Edition (link) BibTeX
• Dieter Kratsch:
  Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs. 225-238
  Electronic Edition (link) BibTeX
• Dana L. Grinstead, Peter J. Slater:
  On minimum dominating sets with minimum intersection. 239-254
  Electronic Edition (link) BibTeX
• Stephen T. Hedetniemi, Renu C. Laskar:
  Bibliography on domination in graphs and some basic definitions of domination parameters. 257-277
  Electronic Edition (link) BibTeX