On the factorization of reducible properties of graphs into irreducible factors

DOI10.7151/DMGT.1017zbMATH Open0845.05076OpenAlexW2082456310MaRDI QIDQ4882592FDOQ4882592

Authors: Peter Mihók, Roman Vasky 

Publication date: 9 July 1996

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8e98f4bb4df75231ef1e6af9ed3d7fbb70cea2b1

Recommendations

• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• Reducible properties of graphs
• Factorizations and characterizations of induced‐hereditary and compositive properties
• Hereditary properties of graphs
• Factorizations of properties of graphs

zbMATH Keywords

additivityfactorizationreducibilityhereditary propertyfactorsreducible properties

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited In (6)

• Factorizations and characterizations of induced‐hereditary and compositive properties
• Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
• Reducible properties of graphs
• Some results on decomposable and reducible graph properties
• Irreducible subfactors from some symmetric graphs
• Title not available (Why is that?)

This page was built for publication: On the factorization of reducible properties of graphs into irreducible factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882592)