Unique Factorization of Compositive Hereditary Graph Properties

作     者：Izak BROERE Ewa DRGAS-BURCHARDT 

作者机构：Department of Mathematics University of Johannesburg Department of Mathematics and Applied MathematicsUniversity of PretoriaPretoria0002South Africa Faculty of Mathematics Computer Science and Econometrics University of Zielona Góra 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2012年第28卷第2期

页      面：267-280页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：Graph property hereditary compositive property unique factorization minimal forbid-den graphs reducibility 

摘      要：A graph property is any class of graphs that is closed under isomorphisms, A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs