On partitionable, confidentially connected and unbreakable graphs.
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică (2011)
- Volume: 19, Issue: 1, page 263-274
- ISSN: 1223-723X
Access Full Article
top
How to cite
topTalmaciu, M., and Nechita, E.. "On partitionable, confidentially connected and unbreakable graphs.." Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică 19.1 (2011): 263-274. <http://eudml.org/doc/222979>.
@article{Talmaciu2011,
author = {Talmaciu, M., Nechita, E.},
journal = {Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică},
keywords = {unbreakable graphs; confidentially connected; star cut set; weakly decomposition; recognition algorithm},
language = {eng},
number = {1},
pages = {263-274},
publisher = {Universitatea “Ovidius"},
title = {On partitionable, confidentially connected and unbreakable graphs.},
url = {http://eudml.org/doc/222979},
volume = {19},
year = {2011},
}
TY - JOUR
AU - Talmaciu, M.
AU - Nechita, E.
TI - On partitionable, confidentially connected and unbreakable graphs.
JO - Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
PY - 2011
PB - Universitatea “Ovidius"
VL - 19
IS - 1
SP - 263
EP - 274
LA - eng
KW - unbreakable graphs; confidentially connected; star cut set; weakly decomposition; recognition algorithm
UR - http://eudml.org/doc/222979
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.