Some results on decomposable and reducible graph properties
DOI10.1016/J.DISC.2012.04.024zbMATH Open1246.05129OpenAlexW2037059520MaRDI QIDQ442353FDOQ442353
Authors: Michael J. Dorfling
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.024
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- The decomposability of additive hereditary properties of graphs
- A survey of hereditary properties of graphs
- Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
- Unique factorization theorem
- Partitions of some planar graphs into two linear forests
- Generalized Ramsey theory and decomposable properties of graphs
- On the completeness of decomposable properties of graphs
- Reducible properties of graphs
- On the factorization of reducible properties of graphs into irreducible factors
Cited In (2)
This page was built for publication: Some results on decomposable and reducible graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442353)