Pages that link to "Item:Q913824"
From MaRDI portal
The following pages link to Primitivity is hereditary for 2-structures (Q913824):
Displayed 33 items.
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament (Q424734) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- T-structures, T-functions, and texts (Q685376) (← links)
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914) (← links)
- Theory of 2-structures. II: Representation through labeled tree families (Q913823) (← links)
- Critical support of an indecomposable graph (Q1000641) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- The recognition of the class of indecomposable digraphs under low hemimorphy (Q1025969) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- Angular 2-structures (Q1184995) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- Indecomposable graphs (Q1367028) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- The \(C_{3}\)-structure of the tournaments. (Q1426106) (← links)
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament). (Q1426559) (← links)
- Critical and infinite tournaments (Q1871488) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- Critical and infinite directed graphs (Q2384422) (← links)
- Indecomposability graph and indecomposability recognition (Q2434744) (← links)
- Morphology of the \((-1)\)-critical tournaments (Q2465787) (← links)
- Partially critical tournaments (Q2476521) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Convex circuit-free coloration of an oriented graph (Q2519795) (← links)
- Finite tournaments with a nonempty diamonds' support (Q2637718) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Cut-primitive directed graphs versus clan-primitive directed graphs (Q3576334) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)