Minimal indecomposable graphs
From MaRDI portal
Publication:1382817
DOI10.1016/S0012-365X(97)00077-0zbMath0897.05070MaRDI QIDQ1382817
Publication date: 19 October 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
posettournamentindecomposable graphminimal indecomposable posets and tournamentsminimal indecomposable symmetric graphs
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (19)
Unnamed Item ⋮ From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ 3-minimal triangle-free graphs ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ 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 \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ Recognition of prime graphs from a prime subgraph ⋮ Critically twin primitive 2-structures ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Triangle-free graphs which are minimal for some nonstable 4-vertex subset ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Letter graphs and modular decomposition ⋮ Unnamed Item ⋮ Indecomposability graph and critical vertices of an indecomposable graph
Cites Work
- Primitivity is hereditary for 2-structures
- \(P_ 4\)-trees and substitution decomposition
- Indecomposable graphs
- Graphs indecomposable with respect to the X-join
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimal indecomposable graphs