Cut-primitive directed graphs versus clan-primitive directed graphs

DOI10.1515/APAM.2010.013zbMath1222.05082OpenAlexW1970351827MaRDI QIDQ3576334

Pierre Ille, Youssef Boudabbous

Publication date: 30 July 2010

Published in: Advances in Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/apam.2010.013

zbMATH Keywords

cutclanclan-primitivecut-primitive

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Intersection properties of maximal directed cuts in digraphs ⋮ The \(\{-2,-1\}\)-selfdual and decomposable tournaments

Cites Work

• Primitivity is hereditary for 2-structures
• \(P_ 4\)-trees and substitution decomposition
• Graphs indecomposable with respect to the X-join
• 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: Cut-primitive directed graphs versus clan-primitive directed graphs