Indecomposable graphs
From MaRDI portal
Publication:1367028
DOI10.1016/S0012-365X(96)00097-0zbMATH Open0882.05108OpenAlexW2912868443MaRDI QIDQ1367028FDOQ1367028
Authors: P. Ille 
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
Recommendations
Cites Work
- Transitiv orientierbare Graphen
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Title not available (Why is that?)
- Primitivity is hereditary for 2-structures
- Theory of 2-structures. II: Representation through labeled tree families
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Primitive 2-structures with the \((n-2)\)-property
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (50)
- Some Algorithms on Conditionally Critical Indecomposable Graphs
- Computing and Combinatorics
- Title not available (Why is that?)
- Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
- Critical 3-hypergraphs
- Title not available (Why is that?)
- Critical and infinite directed graphs
- Partially critical indecomposable graphs
- Decomposability index of tournaments
- Irreducible pairings and indecomposable tournaments
- Recognition of prime graphs from a prime subgraph
- Convex circuit-free coloration of an oriented graph
- INDECOMPOSABILITY GRAPHS OF RINGS
- Decomposability and co-modular indices of tournaments
- Minimal indecomposable graphs
- A characterization of the indecomposable and infinite graphs
- Critical support of an indecomposable graph
- Critically indecomposable graphs
- Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
- Tournaments with maximal decomposability
- The simplicity index of tournaments
- What is reconstruction for ordered sets?
- Finite tournaments with a nonempty diamonds' support
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Title not available (Why is that?)
- Primality, criticality and minimality problems in trees
- Tournaments without acyclic interval.
- Making a tournament indecomposable by one subtournament-reversal operation
- The recognition of the class of indecomposable digraphs under low hemimorphy
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Aggregation of Markov flows I: theory
- Prime 3-uniform hypergraphs
- Morphology of the \((-1)\)-critical tournaments
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Title not available (Why is that?)
- The primality graph of critical 3-hypergraphs
- Indecomposable Laplacian integral graphs
- Well-quasi-ordering and Embeddability of Relational Structures
- Indecomposable tournaments and their indecomposable subtournaments with six vertices
- SIMPLE EXTENSIONS OF COMBINATORIAL STRUCTURES
- Criticality of switching classes of reversible 2-structures labeled by an abelian group
- Graphs critically without duo
- Indecomposability graph and critical vertices of an indecomposable graph
- A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product
- The indecomposable tournaments T with \(|W_5(T)|=|T|-2\)
- The \(C_{3}\)-structure of the tournaments.
- Indecomposability graph and indecomposability recognition
- Subtournaments isomorphic to \(W_5\) in a indecomposable tournament
- Decomposing simple permutations, with enumerative consequences
- Title not available (Why is that?)
This page was built for publication: Indecomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367028)
