The recognition of the class of indecomposable digraphs under low hemimorphy
From MaRDI portal
Publication:1025969
DOI10.1016/J.DISC.2008.08.023zbMATH Open1189.05113OpenAlexW2032511332MaRDI QIDQ1025969FDOQ1025969
Authors: Abderrahim Boussaïri, P. Ille
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.023
Recommendations
- Indecomposability graph and indecomposability recognition
- A lower bound for the recognition of digraph properties
- The recognition of indifference digraphs and generalized semiorders
- Characterizations of two classes of digraphs
- The classification of finite and locally finite connected-homogeneous digraphs
- Classification of some countable descendant-homogeneous digraphs
- A classification of locally semicomplete digraphs
- Set recognition of decomposable graphs and steps towards their reconstruction
- On recognizing graphs by numbers of homomorphisms
- A characterization of the indecomposable and infinite graphs
Cites Work
- Transitiv orientierbare Graphen
- \(P_ 4\)-trees and substitution decomposition
- The \(C_{3}\)-structure of the tournaments.
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Indecomposable graphs
- Minimal indecomposable graphs
- Primitivity is hereditary for 2-structures
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: The recognition of the class of indecomposable digraphs under low hemimorphy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025969)