Geodesic
On partitionable, confidentially connected and unbreakable graphs
Analele Universităţii "Ovidius" Constanţa Seria Matematică, XIX (2011) no. 1
Cet article a éte moissonné depuis la source Analele Stiintifice ale Universitatii Ovidius Constanta website

Voir la notice de l'article

@article{ASUO_2011_XIX_1_a22,
     author = {M. Talmaciu and E. Nechita },
     title = { On partitionable, confidentially connected and
                            unbreakable graphs },
     journal = {Analele Universit\u{a}\c{t}ii "Ovidius" Constan\c{t}a Seria Matematic\u{a}},
     year = {2011},
     volume = {XIX},
     number = {1},
     url = {http://geodesic.mathdoc.fr/item/ASUO_2011_XIX_1_a22/}
}
TY  - JOUR
AU  - M. Talmaciu
AU  - E. Nechita 
TI  - On partitionable, confidentially connected and
                            unbreakable graphs 
JO  - Analele Universităţii "Ovidius" Constanţa Seria Matematică
PY  - 2011
VL  - XIX
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/ASUO_2011_XIX_1_a22/
ID  - ASUO_2011_XIX_1_a22
ER  - 
%0 Journal Article
%A M. Talmaciu
%A E. Nechita 
%T On partitionable, confidentially connected and
                            unbreakable graphs 
%J Analele Universităţii "Ovidius" Constanţa Seria Matematică
%D 2011
%V XIX
%N 1
%U http://geodesic.mathdoc.fr/item/ASUO_2011_XIX_1_a22/
%F ASUO_2011_XIX_1_a22
M. Talmaciu; E. Nechita . On partitionable, confidentially connected and
                            unbreakable graphs. Analele Universităţii "Ovidius" Constanţa Seria Matematică, XIX (2011) no. 1. http://geodesic.mathdoc.fr/item/ASUO_2011_XIX_1_a22/