Pages that link to "Item:Q1394240"
From MaRDI portal
The following pages link to Graphs indecomposable with respect to the X-join (Q1394240):
Displaying 40 items.
- Unavoidable induced subgraphs in large graphs with no homogeneous sets (Q256979) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Antichain cutsets (Q762182) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Clique-width of graphs defined by one-vertex extensions (Q998353) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- On minimal prime graphs and posets (Q1047188) (← links)
- On the X-join decomposition for undirected graphs (Q1142232) (← links)
- Partitive hypergraphs (Q1160636) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- The nucleus of a point determining graph (Q1225629) (← links)
- Nuclei for totally point determining graphs (Q1245980) (← links)
- The structure of projection-valued states: A generalization of Wigner's theorem (Q1247576) (← links)
- The edge nucleus of a point-determining graph (Q1247985) (← links)
- Incremental construction of 2-structures (Q1322177) (← links)
- Primitive 2-structures with the \((n-2)\)-property (Q1334660) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- Minimal indecomposable graphs (Q1382817) (← links)
- The \((\leq 5)\)-hypomorphy of digraphs up to complementation (Q1713868) (← links)
- Critical and infinite tournaments (Q1871488) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Ultracritical and hypercritical binary structures (Q2275373) (← links)
- Critical and infinite directed graphs (Q2384422) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Partially critical tournaments (Q2476521) (← links)
- Cut-primitive directed graphs versus clan-primitive directed graphs (Q3576334) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
- Nesting of prime substructures in \(k-\)ary relations (Q5941284) (← links)
- Birecognition of prime graphs, and minimal prime graphs (Q6115742) (← links)
- Primality, criticality and minimality problems in trees (Q6132864) (← links)
- Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet (Q6493754) (← links)
- Well-quasi-ordering and Embeddability of Relational Structures (Q6493759) (← links)
