Meet- and join-irreducibility of additive hereditary properties of graphs
type: Item
instance of: scholarly article
title: Meet- and join-irreducibility of additive hereditary properties of graphs
zbMATH Open document ID: 1003.05101
DOI: 10.1016/S0012-365X(01)00323-5
author: Amelie J. Berger
author: Izak Broere
author: Samuel J. T. Moagi
author: Peter Mihók
published in: Discrete Mathematics
publication date: 2002-08-29T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 06B10
zbMATH DE Number: 1792395
zbMATH Keywords: property of graphs
zbMATH Keywords: irreducible property
zbMATH Keywords: reducible property
zbMATH Keywords: lattice of properties of graphs
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00323-5
OpenAlex ID: W2034406875
description: scientific article; zbMATH DE number 1792395