Meet- and join-irreducibility of additive hereditary properties of graphs
From MaRDI portal
Any class of simple graphs which is closed under subgraphs, isomorphisms, and unions is named an additive hereditary property of graphs. The set of all additive hereditary properties of graphs, partially ordered by set inclusion, is a lattice. The elements of this lattice which are meet-, join- and doubly-irreducible are studied. The authors discuss the significance of these elements for the lattice of ideals of this lattice.
Recommendations
- On the lattice of additive hereditary properties of finite graphs
- Joins of additive hereditary graph properties
- Minimal reducible bounds in the lattice of additive hereditary graph properties
- Prime ideals in the lattice of additive induced-hereditary graph properties
- Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
Cited in
(8)- Minimal reducible bounds in the lattice of additive hereditary graph properties
- Graph classes generated by Mycielskians
- Unique factorization of compositive hereditary graph properties
- The decomposability of additive hereditary properties of graphs
- On uniqueness of a general factorization of graph properties
- On the lattice of additive hereditary properties of finite graphs
- Prime ideals in the lattice of additive induced-hereditary graph properties
- Joins of additive hereditary graph properties
This page was built for publication: Meet- and join-irreducibility of additive hereditary properties of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613465)