The following pages link to (Q4492680):
Displaying 50 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)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- Definable transductions and weighted logics for texts (Q844894) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Enumerating submultisets of multisets (Q1007533) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- Transitivity of local complementation and switching on graphs. (Q1427469) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- On scattered convex geometries (Q1686202) (← links)
- Countable linear orders with disjoint infinite intervals are mutually orthogonal (Q1752659) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- Complementation, local complementation, and switching in binary matroids (Q2020035) (← links)
- Prime 3-uniform hypergraphs (Q2053735) (← links)
- From modular decomposition trees to rooted median graphs (Q2074346) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Critical 3-hypergraphs (Q2108059) (← links)
- The idiosyncratic polynomial of digraphs (Q2155544) (← links)
- Prime orientable graphs (Q2237224) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- Orthogonal countable linear orders (Q2314417) (← links)
- Interval orders, semiorders and ordered groups (Q2332813) (← links)
- Decomposing simple permutations, with enumerative consequences (Q2377669) (← links)
- The rank-width of edge-coloured graphs (Q2392245) (← links)
- A matrix description of weakly bipartitive and bipartitive families (Q2404970) (← links)
- \((\leq k)\)-reconstructible binary relations (Q2434745) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- Embedding linear orders in grids (Q2491206) (← links)
- Recognizability, hypergraph operations, and logical types (Q2496296) (← links)
- Indecomposable tournaments and their indecomposable subtournaments with six vertices (Q2517075) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs (Q3014938) (← links)
- 3-uniform hypergraphs: modular decomposition and realization by tournaments (Q3303522) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← links)
