Unique factorization of compositive hereditary graph properties

DOI10.1007/S10114-011-0111-YzbMath1334.05112OpenAlexW1967138616MaRDI QIDQ270251

Izak Broere, Ewa Drgas-Burchardt

Publication date: 7 April 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-0111-y

zbMATH Keywords

reducibilitygraph propertyhereditarycompositive propertyminimal forbidden graphsunique factorization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
• Meet- and join-irreducibility of additive hereditary properties of graphs
• Minimal forbidden subgraphs of reducible graph properties
• Cardinality of a minimal forbidden graph family for reducible additive hereditary graph properties
• On uniqueness of a general factorization of graph properties
• On the lattice of additive hereditary properties of finite graphs
• Unique factorisation of additive induced-hereditary properties
• Factorizations and characterizations of induced‐hereditary and compositive properties
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• Transitiv orientierbare Graphen
• Colour Classes for r-Graphs

This page was built for publication: Unique factorization of compositive hereditary graph properties