Primitivity is hereditary for 2-structures (Q913824): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Complement reducible graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of 2-structures. I: Clans, basic subclasses, and morphisms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of 2-structures. II: Representation through labeled tree families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a property of the class of n-colorable graphs / rank | |||
Normal rank |
Revision as of 14:51, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Primitivity is hereditary for 2-structures |
scientific article |
Statements
Primitivity is hereditary for 2-structures (English)
0 references
1990
0 references
It is proved that each primitive 2-structure is built-up by adding one or two elements to a primitive 2-structure. The importance of this fact follows from the fact that every 2-structure can be decomposed into primitive, complete and linear 2-structures. While linear and complete 2-structures have rather simple structure (they are much like linear orders and complete or totally disconnected graphs), the primitive 2-structures are difficult to understand.
0 references
edge-labeled graph
0 references
clan
0 references
2-structures
0 references