The recognition of the class of indecomposable digraphs under low hemimorphy

DOI10.1016/J.DISC.2008.08.023zbMath1189.05113OpenAlexW2032511332MaRDI QIDQ1025969

Pierre Ille, Abderrahim Boussaïri

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

zbMATH Keywords

intervalhemimorphyindecomposable digraph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Primitivity is hereditary for 2-structures
• \(P_ 4\)-trees and substitution decomposition
• Indecomposable graphs
• Minimal indecomposable graphs
• The \(C_{3}\)-structure of the tournaments.
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Transitiv orientierbare Graphen

This page was built for publication: The recognition of the class of indecomposable digraphs under low hemimorphy