Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
From MaRDI portal
DOI10.1002/(SICI)1097-0118(200001)33:1%3C44::AID-JGT5%3E3.0.CO;2-OzbMATH Open0942.05056OpenAlexW4230765323MaRDI QIDQ4944685FDOQ4944685
Authors: Peter Mihók, Roman Vasky, Gabriel Semanišin 
Publication date: 21 March 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200001)33:1%3C44::aid-jgt5%3E3.0.co;2-o
Recommendations
- Factorizations and characterizations of induced‐hereditary and compositive properties
- Unique factorisation of additive induced-hereditary properties
- On the factorization of reducible properties of graphs into irreducible factors
- Hom-properties are uniquely factorizable into irreducible factors
- Unique factorization theorem
Cites Work
Cited In (15)
- Unique factorisation of additive induced-hereditary properties
- Factorizations and characterizations of induced‐hereditary and compositive properties
- Title not available (Why is that?)
- Unique factorization of compositive hereditary graph properties
- Reducible properties of graphs
- Some results on decomposable and reducible graph properties
- On invariants of hereditary graph properties
- Unique Factorization Theorem and Formal Concept Analysis
- Meet- and join-irreducibility of additive hereditary properties of graphs
- Title not available (Why is that?)
- Minimal reducible bounds for induced-hereditary properties
- The decomposability of additive hereditary properties of graphs
- Unique factorization theorem
- On uniqueness of a general factorization of graph properties
- The property of \(k\)-colourable graphs is uniquely decomposable
This page was built for publication: Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944685)
