Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică, Tome 19 (2011), p. 263-274
/ Harvested from The Electronic Library of Mathematics
@article{05912069,
title = {On partitionable, confidentially connected and unbreakable graphs.},
journal = {Analele \c Stiin\c tifice ale Universit\u a\c tii ``Ovidius" Constan\c ta. Seria: Matematic\u a},
volume = {19},
year = {2011},
pages = {263-274},
zbl = {1224.05205},
language = {en},
url = {http://dml.mathdoc.fr/item/05912069}
}
Talmaciu, M.; Nechita, E. On partitionable, confidentially connected and unbreakable graphs.. Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică, Tome 19 (2011) pp. 263-274. http://gdmltest.u-ga.fr/item/05912069/