Meet- and join-irreducibility of additive hereditary properties of graphs (Q1613465)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1792395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Meet- and join-irreducibility of additive hereditary properties of graphs |
scientific article; zbMATH DE number 1792395 |
Statements
Meet- and join-irreducibility of additive hereditary properties of graphs (English)
0 references
29 August 2002
0 references
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.
0 references
property of graphs
0 references
irreducible property
0 references
reducible property
0 references
lattice of properties of graphs
0 references
0.841281533241272
0 references
0.8374907374382019
0 references
0.8265140652656555
0 references
0.8009993433952332
0 references
