Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR ZblKeywords: cut-vertex; dominating set; minimal acyclic dominating set; acyclic domination number; upper acyclic domination number
Samodivkin, Vladmir. Minimal acyclic dominating sets and cut-vertices. Mathematica Bohemica, Tome 130 (2005) no. 1, pp. 81-88. doi: 10.21136/MB.2005.134216
@article{10_21136_MB_2005_134216,
author = {Samodivkin, Vladmir},
title = {Minimal acyclic dominating sets and cut-vertices},
journal = {Mathematica Bohemica},
pages = {81--88},
year = {2005},
volume = {130},
number = {1},
doi = {10.21136/MB.2005.134216},
mrnumber = {2128361},
zbl = {1112.05080},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.2005.134216/}
}
[1] R. C. Brigham, P. Z. Chinn, R. D. Dutton: Vertex domination-critical graphs. Networks 18 (1988), 173–179. | DOI | MR
[2] G. H. Fricke, T. W. Haynes, S. M.Hedetniemi, S. T. Hedetniemi, R. C. Laskar: Excellent trees. Bull. Inst. Comb. Appl. 34 (2002), 27–38. | MR
[3] F. Harary, T. W. Haynes: Conditional graph theory IV: Dominating sets. Util. Math. 48 (1995), 179–192. | MR
[4] T. W. Haynes, S. T. Hedetniemi, P. J. Slater: Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998. | MR
[5] T. W. Haynes, S. T. Hedetniemi, P. J. Slater (eds.): Domination in Graphs—Advanced Topics. Marcel Dekker, New York, 1998. | MR
[6] S. M. Hedetniemi, S. T. Hedetniemi, D. F. Rall: Acyclic domination. Discrete Math. 222 (2000), 151–165. | DOI | MR
[7] P. D. Vestergaard, B. Zelinka: Cut-vertices and domination in graphs. Math. Bohem. 120 (1995), 135–143. | MR
Cité par Sources :