Primitive 2-structures with the \((n-2)\)-property

DOI10.1016/0304-3975(94)90231-3zbMath0822.68078OpenAlexW2060028821MaRDI QIDQ1334660

Paola Bonizzoni

Publication date: 25 September 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90231-3

zbMATH Keywords

primitive 2-structure\(n\) elementsreversible 2-structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (10)

A \(k\)-structure generalization of the theory of 2-structures ⋮ Indecomposable graphs ⋮ A tight lower bound for primitivity in k-structures ⋮ Critically twin primitive 2-structures ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Theory of 2-structures ⋮ Nesting of prime substructures in \(k-\)ary relations ⋮ Critically indecomposable graphs ⋮ Editing to prime graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Theory of 2-structures. I: Clans, basic subclasses, and morphisms
• Theory of 2-structures. II: Representation through labeled tree families
• Primitivity is hereditary for 2-structures
• Angular 2-structures
• Graphs indecomposable with respect to the X-join
• On Comparability and Permutation Graphs
• Incremental modular decomposition
• A tight lower bound for primitivity in k-structures

This page was built for publication: Primitive 2-structures with the \((n-2)\)-property