Indecomposability graph and indecomposability recognition
From MaRDI portal
Publication:2434744
DOI10.1016/j.ejc.2013.07.009zbMath1282.05187OpenAlexW2086817112MaRDI QIDQ2434744
Pierre Ille, Abdelhak Chaïchaâ, Abderrahim Boussaïri
Publication date: 7 February 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.07.009
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitivity is hereditary for 2-structures
- \(P_ 4\)-trees and substitution decomposition
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Indecomposable graphs
- Minimal indecomposable graphs
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- The falsity of the reconstruction conjecture for tournaments
- Graph reconstruction—a survey
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- Transitiv orientierbare Graphen