Title of article
Meet- and join-irreducibility of additive hereditary properties of graphs Original Research Article
Author/Authors
Amelie J. Berger، نويسنده , , Izak Broere، نويسنده , , Samuel J.T. Moagi، نويسنده , , Peter Mih?k، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
8
From page
11
To page
18
Abstract
An additive hereditary property of graphs is any class of simple graphs which is closed under unions, subgraphs and isomorphisms. The set of all such properties is a lattice with set inclusion as the partial ordering. We study the elements of this lattice which are meet- join- and doubly-irreducible. The significance of these elements for the lattice of ideals of this lattice is discussed.
Keywords
Irreducible property , Lattice of properties of graphs , Reducible property , Property of graphs
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950087
Link To Document