On the completeness of decomposable properties of graphs

DOI10.7151/DMGT.1097MaRDI QIDQ4498988zbMATH OpenOpenAlexFDO

Authors Mariusz Hałuszczak, Pavol Vateha

Publication date 9 April 2001

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

Full work available at URL https://doi.org/10.7151/dmgt.1097

zbMATH Keywords

completenessdecompositionhereditary propertiespartition

Mathematics Subject Classification ID

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

Recommendations

• The decomposability of additive hereditary properties of graphs
• Reducible properties of graphs
• Some results on decomposable and reducible graph properties
• The property of \(k\)-colourable graphs is uniquely decomposable
• On invariants of hereditary graph properties

Cited in

(11)

• On complementary decompositions of the complete graph
• Graphs having the local decomposition property
• On a graph theoretic division algorithm and maximal decompositions of graphs
• Edge-colouring of graphs and hereditary graph properties.
• The six bidecomposable graphs
• scientific article; zbMATH DE number 3966133 (Why is no real title available?)
• The property of \(k\)-colourable graphs is uniquely decomposable
• Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
• Some results on decomposable and reducible graph properties
• scientific article; zbMATH DE number 841628 (Why is no real title available?)
• Completeness and related properties of the graph topology on function spaces

This page was built for publication: On the completeness of decomposable properties of graphs

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