On the completeness of decomposable properties of graphs
Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 2, pp. 229-236

Voir la notice de l'article provenant de la source Library of Science

Let ₁,₂ be additive hereditary properties of graphs. A (₁,₂)-decomposition of a graph G is a partition of E(G) into sets E₁, E₂ such that induced subgraph G[E_i] has the property _i, i = 1,2. Let us define a property ₁⊕₂ by G: G has a (₁,₂)-decomposition.
Keywords: decomposition, hereditary property, completeness
@article{DMGT_1999_19_2_a8,
     author = {Ha{\l}uszczak, Mariusz and Vateha, Pavol},
     title = {On the completeness of decomposable properties of graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {229--236},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {1999},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1999_19_2_a8/}
}
TY  - JOUR
AU  - Hałuszczak, Mariusz
AU  - Vateha, Pavol
TI  - On the completeness of decomposable properties of graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1999
SP  - 229
EP  - 236
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1999_19_2_a8/
LA  - en
ID  - DMGT_1999_19_2_a8
ER  - 
%0 Journal Article
%A Hałuszczak, Mariusz
%A Vateha, Pavol
%T On the completeness of decomposable properties of graphs
%J Discussiones Mathematicae. Graph Theory
%D 1999
%P 229-236
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1999_19_2_a8/
%G en
%F DMGT_1999_19_2_a8
Hałuszczak, Mariusz; Vateha, Pavol. On the completeness of decomposable properties of graphs. Discussiones Mathematicae. Graph Theory, Tome 19 (1999) no. 2, pp. 229-236. http://geodesic.mathdoc.fr/item/DMGT_1999_19_2_a8/