Primitivity is Hereditary for 2-Structures
暂无分享,去创建一个
Abstract It is proved that each primitive 2-structure on n elements ( n ⩾3) contains a primitive substructure on either ( n −1) or ( n −2) elements.
[1] D. Seinsche. On a property of the class of n-colorable graphs , 1974 .
[2] Andrzej Ehrenfeucht,et al. Theory of 2-Structures, Part II: Representation Through Labeled Tree Families , 1990, Theor. Comput. Sci..
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..
[5] Andrzej Ehrenfeucht,et al. Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms , 1990, Theor. Comput. Sci..