The decomposability of additive hereditary properties of graphs

Izak Broere, and Michael J. Dorfling. "The decomposability of additive hereditary properties of graphs." Discussiones Mathematicae Graph Theory 20.2 (2000): 281-291. <http://eudml.org/doc/270686>.

@article{IzakBroere2000,
abstract = {An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If ₁,...,ₙ are properties of graphs, then a (₁,...,ₙ)-decomposition of a graph G is a partition E₁,...,Eₙ of E(G) such that $G[E_i]$, the subgraph of G induced by $E_i$, is in $_i$, for i = 1,...,n. We define ₁ ⊕...⊕ ₙ as the property G ∈ : G has a (₁,...,ₙ)-decomposition. A property is said to be decomposable if there exist non-trivial hereditary properties ₁ and ₂ such that = ₁⊕ ₂. We study the decomposability of the well-known properties of graphs ₖ, ₖ, ₖ, ₖ, ₖ, ₖ and $ ^\{p\}$.},
author = {Izak Broere, Michael J. Dorfling},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {property of graphs; additive; hereditary; decomposable property of graphs; additive hereditary property; decomposability},
language = {eng},
number = {2},
pages = {281-291},
title = {The decomposability of additive hereditary properties of graphs},
url = {http://eudml.org/doc/270686},
volume = {20},
year = {2000},
}

TY - JOUR
AU - Izak Broere
AU - Michael J. Dorfling
TI - The decomposability of additive hereditary properties of graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2000
VL - 20
IS - 2
SP - 281
EP - 291
AB - An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If ₁,...,ₙ are properties of graphs, then a (₁,...,ₙ)-decomposition of a graph G is a partition E₁,...,Eₙ of E(G) such that $G[E_i]$, the subgraph of G induced by $E_i$, is in $_i$, for i = 1,...,n. We define ₁ ⊕...⊕ ₙ as the property G ∈ : G has a (₁,...,ₙ)-decomposition. A property is said to be decomposable if there exist non-trivial hereditary properties ₁ and ₂ such that = ₁⊕ ₂. We study the decomposability of the well-known properties of graphs ₖ, ₖ, ₖ, ₖ, ₖ, ₖ and $ ^{p}$.
LA - eng
KW - property of graphs; additive; hereditary; decomposable property of graphs; additive hereditary property; decomposability
UR - http://eudml.org/doc/270686
ER -