Indecomposable graphs
From MaRDI portal
Publication:1367028
DOI10.1016/S0012-365X(96)00097-0zbMath0882.05108OpenAlexW2912868443MaRDI QIDQ1367028
Publication date: 2 March 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00097-0
Related Items (39)
Decomposing simple permutations, with enumerative consequences ⋮ Tournaments with maximal decomposability ⋮ Finite tournaments with a nonempty diamonds' support ⋮ Critical and infinite directed graphs ⋮ Indecomposable tournaments and their indecomposable subtournaments on 5 vertices ⋮ Decomposability and co-modular indices of tournaments ⋮ Decomposability index of tournaments ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ The indecomposable tournaments T with \(|W_5(T)|=|T|-2\) ⋮ Minimal indecomposable graphs ⋮ Unnamed Item ⋮ Primality, criticality and minimality problems in trees ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs ⋮ Subtournaments isomorphic to \(W_5\) in a indecomposable tournament ⋮ Indecomposability graph and indecomposability recognition ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ Recognition of prime graphs from a prime subgraph ⋮ The simplicity index of tournaments ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ Morphology of the \((-1)\)-critical tournaments ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Aggregation of Markov flows I: theory ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ What is reconstruction for ordered sets? ⋮ Critical support of an indecomposable graph ⋮ Critically indecomposable graphs ⋮ Indecomposable tournaments and their indecomposable subtournaments with six vertices ⋮ Convex circuit-free coloration of an oriented graph ⋮ Making a tournament indecomposable by one subtournament-reversal operation ⋮ Prime 3-uniform hypergraphs ⋮ SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES ⋮ Graphs critically without duo ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Unnamed Item ⋮ Indecomposability graph and critical vertices of an indecomposable graph ⋮ Tournaments without acyclic interval. ⋮ Some Algorithms on Conditionally Critical Indecomposable Graphs ⋮ Critical 3-hypergraphs
Cites Work
- Theory of 2-structures. II: Representation through labeled tree families
- Primitivity is hereditary for 2-structures
- Primitive 2-structures with the \((n-2)\)-property
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Indecomposable graphs
