Graphs indecomposable with respect to the X-join
From MaRDI portal
Publication:1394240
DOI10.1016/0012-365X(73)90100-3zbMath0279.05125MaRDI QIDQ1394240
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
Primitive 2-structures with the \((n-2)\)-property ⋮ Critical and infinite directed graphs ⋮ Scattering number and modular decomposition ⋮ The monadic second-order logic of graphs. X: Linear orderings ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Minimal indecomposable graphs ⋮ On the X-join decomposition for undirected graphs ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ Primality, criticality and minimality problems in trees ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Partitive hypergraphs ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Recognition of prime graphs from a prime subgraph ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Approximate association via dissociation ⋮ Partially critical tournaments ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ Cut-primitive directed graphs versus clan-primitive directed graphs ⋮ Not complementary connected and not CIS \(d\)-graphs form weakly monotone families ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ Nesting of prime substructures in \(k-\)ary relations ⋮ The nucleus of a point determining graph ⋮ Ultracritical and hypercritical binary structures ⋮ Nuclei for totally point determining graphs ⋮ Clique-width of graphs defined by one-vertex extensions ⋮ The structure of projection-valued states: A generalization of Wigner's theorem ⋮ The edge nucleus of a point-determining graph ⋮ Critically indecomposable graphs ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Antichain cutsets ⋮ Vertex- and edge-minimal and locally minimal graphs ⋮ Indecomposability graph and critical vertices of an indecomposable graph ⋮ On minimal prime graphs and posets ⋮ PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT ⋮ Incremental construction of 2-structures ⋮ Unavoidable induced subgraphs in large graphs with no homogeneous sets ⋮ Critical and infinite tournaments
Cites Work
