On infinite uniquely partitionable graphs and graph properties of finite character
暂无分享,去创建一个
[1] Edward R. Scheinerman,et al. On the structure of hereditary classes of graphs , 1986 .
[2] R. Graham,et al. Handbook of Combinatorics , 1995 .
[3] S. Shelah,et al. Universal Graphs with Forbidden Subgraphs and Algebraic Closure , 1998, math/9809202.
[4] Norbert Sauer. Canonical Vertex Partitions , 2003, Comb. Probab. Comput..
[5] Marietjie Frick,et al. Uniquely partitionable graphs , 1997, Discuss. Math. Graph Theory.
[6] Frank Harary,et al. Uniquely colorable graphs , 1969 .
[7] Bernhard Ganter,et al. Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings , 2008, International Conference on Formal Concept Analysis.
[8] Robert Cowen,et al. GRAPH COLORING COMPACTNESS THEOREMS EQUIVALENT TO BPI , 2002 .
[9] Peter Mihók,et al. Unique factorization theorem , 2000, Discuss. Math. Graph Theory.
[10] Peter Mihók,et al. Factorizations and characterizations of induced-hereditary and compositive properties , 2005, J. Graph Theory.
[11] Peter Mihók,et al. Unique Factorization Theorem and Formal Concept Analysis , 2006, CLA.
[12] Bernhard Ganter,et al. Formal Concept Analysis: Mathematical Foundations , 1998 .
[13] Peter Mihók,et al. Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties , 2002, Discuss. Math. Graph Theory.
[14] Marietjie Frick,et al. A survey of hereditary properties of graphs , 1997, Discuss. Math. Graph Theory.