Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200001)33:1<44::AID-JGT5>3.0.CO;2-O" /><44::AID-JGT5>3.0.CO;2-O 10.1002/(SICI)1097-0118(200001)33:1<44::AID-JGT5>3.0.CO;2-OzbMath0942.05056OpenAlexW4230765323MaRDI QIDQ4944685

Peter Mihók, Roman Vasky, Gabriel Semanisin

Publication date: 21 March 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200001)33:1<44::aid-jgt5>3.0.co;2-o

zbMATH Keywords

generating setsfactorizationhereditary property of graphsmaximal graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Unique factorization of compositive hereditary graph properties ⋮ Minimal reducible bounds for induced-hereditary properties ⋮ The property of \(k\)-colourable graphs is uniquely decomposable ⋮ Some results on decomposable and reducible graph properties ⋮ Unique Factorization Theorem and Formal Concept Analysis ⋮ Unnamed Item ⋮ On uniqueness of a general factorization of graph properties

Cites Work

• A survey of hereditary properties of graphs
• Generalized colorings and avoidable orientations
• On generating sets of induced-hereditary properties
• On the factorization of reducible properties of graphs into irreducible factors
• Colour Classes for r-Graphs

This page was built for publication: Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors