Indecomposability graph and indecomposability recognition
From MaRDI portal
Publication:2434744
Recommendations
Cites work
- \(P_ 4\)-trees and substitution decomposition
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Graph reconstruction—a survey
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 512932 (Why is no real title available?)
- scientific article; zbMATH DE number 887768 (Why is no real title available?)
- Indecomposable graphs
- Minimal indecomposable graphs
- Primitivity is hereditary for 2-structures
- 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
- The falsity of the reconstruction conjecture for tournaments
- Transitiv orientierbare Graphen
Cited in
(11)- The recognition of the class of indecomposable digraphs under low hemimorphy
- Indecomposability graph and critical vertices of an indecomposable graph
- Indecomposable graphs
- Minimal indecomposable graphs
- Set recognition of decomposable graphs and steps towards their reconstruction
- Recognizing decomposable graphs
- scientific article; zbMATH DE number 599133 (Why is no real title available?)
- scientific article; zbMATH DE number 1953084 (Why is no real title available?)
- Graphs whose indecomposability graph is 2-covered
- Recognizing indecomposability for tournaments
- Birecognition of prime graphs, and minimal prime graphs
This page was built for publication: Indecomposability graph and indecomposability recognition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434744)