2000
DOI: 10.7151/dmgt.1114
|View full text |Cite
|
Sign up to set email alerts
|

Unique factorization theorem

Abstract: A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let P 1 , P 2 , . . . , P n be properties of graphs. A graph G isA property R is said to be reducible if there exist properties P 1 and P 2 such that R = P 1 •P 2 ; otherwise the property R is irreducible. We prove that every additive and inducedhereditary property is uniquely factorizable into i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
30
0

Year Published

2004
2004
2013
2013

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 12 publications
(31 citation statements)
references
References 11 publications
1
30
0
Order By: Relevance
“…We use this characterization here to give a new proof of the result of Mihók et al [19] that hereditary compositive and additive hereditary properties have a (unique) factorization into irreducible properties with the same restrictions. There are similar, but more difficult, results for indiscompositive and additive induced-hereditary properties [10,18]. We are grateful to Jim Geelen for suggesting this approach.…”
Section: Factorization Of Additive Hereditary Propertiesmentioning
confidence: 94%
See 4 more Smart Citations
“…We use this characterization here to give a new proof of the result of Mihók et al [19] that hereditary compositive and additive hereditary properties have a (unique) factorization into irreducible properties with the same restrictions. There are similar, but more difficult, results for indiscompositive and additive induced-hereditary properties [10,18]. We are grateful to Jim Geelen for suggesting this approach.…”
Section: Factorization Of Additive Hereditary Propertiesmentioning
confidence: 94%
“…(Since it is rather more complicated, we do not discuss here the analogous concept for indiscompositive properties. However, it is in [11,18], and the indiscompositive factorization is given in the manner of this paper in [10].) A graph G is decomposable if it is the join of two graphs; otherwise, G is indecomposable.…”
Section: Factorization Of Additive Hereditary Propertiesmentioning
confidence: 99%
See 3 more Smart Citations