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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
