scientific article; zbMATH DE number 1478125
From MaRDI portal
Publication:4492680
Recommendations
Cited in
(72)- Critically indecomposable graphs
- Enumerating submultisets of multisets
- PC trees and circular-ones arrangements.
- Transitivity of local complementation and switching on graphs.
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments
- On scattered convex geometries
- Countable linear orders with disjoint infinite intervals are mutually orthogonal
- Finite orders which are reconstructible up to duality by their comparability graphs
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations
- Complementation, local complementation, and switching in binary matroids
- Prime 3-uniform hypergraphs
- From modular decomposition trees to rooted median graphs
- A type of algebraic structure related to sets of intervals
- Critical 3-hypergraphs
- The idiosyncratic polynomial of digraphs
- Prime orientable graphs
- Ultracritical and hypercritical binary structures
- Orthogonal countable linear orders
- Interval orders, semiorders and ordered groups
- Decomposing simple permutations, with enumerative consequences
- The rank-width of edge-coloured graphs
- A matrix description of weakly bipartitive and bipartitive families
- \((\leq k)\)-reconstructible binary relations
- Recognition of prime graphs from a prime subgraph
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Embedding linear orders in grids
- Recognizability, hypergraph operations, and logical types
- Indecomposable tournaments and their indecomposable subtournaments with six vertices
- Complete edge-colored permutation graphs
- F-rank-width of (edge-colored) graphs
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
- Pairs of orthogonal countable ordinals
- Decomposition tree of a lexicographic product of binary structures
- Nash equilibria and values through modular partitions in infinite games
- Tree-representation of set families and applications to combinatorial decompositions
- On switching classes, NLC-width, cliquewidth and treewidth
- Lexicographic products with high reconstruction numbers
- Prechains and self duality
- scientific article; zbMATH DE number 591000 (Why is no real title available?)
- A survey of the algorithmic aspects of modular decomposition
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Description of the orders which are hereditarily half-reconstructible by their comparability graphs
- Recognizing indecomposability for tournaments
- Critically twin primitive 2-structures
- Criticality of switching classes of reversible 2-structures labeled by an abelian group
- An Analytic Propositional Proof System on Graphs
- scientific article; zbMATH DE number 7297127 (Why is no real title available?)
- A Representation Theorem for Union-Difference Families and Application
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
- Join-irreducible Boolean functions
- Birecognition of prime graphs, and minimal prime graphs
- Primality, criticality and minimality problems in trees
- The primality graph of critical 3-hypergraphs
- Methods of graph decompositions
- Hereditary classes of ordered sets of width at most two
- Unstable graphs and packing into fifth power
- Characterization of \(k\)-spectrally monomorphic Hermitian matrices
- Minimal prime ages, words and permutation graphs
- T-structures, T-functions, and texts
- Ordered structures with no finite monomorphic decomposition: application to the profile of hereditary classes
- Siblings of countable cographs
- The 3-forced 2-structures
- When a decomposable tournament is \(\{-1,3\}\)-reconstructible?
- Sequent systems on undirected graphs
- CMSO-transducing tree-like graph decompositions
- Automorphism group of a wreath product of binary structures
- Existential MSO over two successors is strictly weaker than over linear orders
- Definable transductions and weighted logics for texts
- Finite metrics in switching classes
- The morphology of infinite tournaments; application to the growth of their profile
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4492680)
