A characterization of graphs in which some minimum dominating set covers all the edges
Czechoslovak Mathematical Journal, Tome 45 (1995) no. 2, pp. 221-230
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
@article{10_21136_CMJ_1995_128526,
author = {Hartnell, Bert and Rall, Douglas F.},
title = {A characterization of graphs in which some minimum dominating set covers all the edges},
journal = {Czechoslovak Mathematical Journal},
pages = {221--230},
publisher = {mathdoc},
volume = {45},
number = {2},
year = {1995},
doi = {10.21136/CMJ.1995.128526},
mrnumber = {1331459},
zbl = {0836.05065},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128526/}
}
TY - JOUR AU - Hartnell, Bert AU - Rall, Douglas F. TI - A characterization of graphs in which some minimum dominating set covers all the edges JO - Czechoslovak Mathematical Journal PY - 1995 SP - 221 EP - 230 VL - 45 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128526/ DO - 10.21136/CMJ.1995.128526 LA - en ID - 10_21136_CMJ_1995_128526 ER -
%0 Journal Article %A Hartnell, Bert %A Rall, Douglas F. %T A characterization of graphs in which some minimum dominating set covers all the edges %J Czechoslovak Mathematical Journal %D 1995 %P 221-230 %V 45 %N 2 %I mathdoc %U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1995.128526/ %R 10.21136/CMJ.1995.128526 %G en %F 10_21136_CMJ_1995_128526
Hartnell, Bert; Rall, Douglas F. A characterization of graphs in which some minimum dominating set covers all the edges. Czechoslovak Mathematical Journal, Tome 45 (1995) no. 2, pp. 221-230. doi: 10.21136/CMJ.1995.128526
Cité par Sources :