A tight lower bound for primitivity in k-structures
From MaRDI portal
Publication:4632456
DOI10.1007/3-540-58201-0_98zbMath1418.68163OpenAlexW1546400094MaRDI QIDQ4632456
Publication date: 29 April 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58201-0_98
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Primitive 2-structures with the \((n-2)\)-property, Nesting of prime substructures in \(k-\)ary relations
Cites Work
- Almost all comparability graphs are UPO
- 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
- Primitive 2-structures with the \((n-2)\)-property
- A \(k\)-structure generalization of the theory of 2-structures
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- On Comparability and Permutation Graphs
- The Recognition of Series Parallel Digraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item