The following pages link to (Q4492680):
Displaying 17 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- Pairs of orthogonal countable ordinals (Q400437) (← links)
- Decomposition tree of a lexicographic product of binary structures (Q409340) (← links)
- Nash equilibria and values through modular partitions in infinite games (Q409463) (← links)
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Prechains and self duality (Q418880) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Criticality of switching classes of reversible 2-structures labeled by an abelian group (Q503678) (← links)
- Join-irreducible Boolean functions (Q603893) (← links)
- T-structures, T-functions, and texts (Q685376) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← links)
- Primality, criticality and minimality problems in trees (Q6132864) (← links)
- The primality graph of critical 3-hypergraphs (Q6489359) (← links)
