The (-1)-critically duo-free tournaments.

MaRDI QIDQ2804812zbMATH OpenFDO

Authors Mohamed Baka Elayech, Abdeljelil Salhi, Hamza Si Kaddour

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

interval\(d\)-critical vertex\(d\)-indecomposability graphcritically duo-free tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The \((-1)\)-critical tournaments
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• Morphology of the \((-1)\)-critical tournaments
• Indecomposability and duality of tournaments
• Sur la (-k)-demi-reconstructibilité des tournois finis
• scientific article; zbMATH DE number 962491
• \(p/d\)-graphs of tournaments.
• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• scientific article; zbMATH DE number 2077654

Cited in

(7)

• scientific article; zbMATH DE number 7297127 (Why is no real title available?)
• Recognizing indecomposability for tournaments
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• Graphs critically without duo
• Primality, criticality and minimality problems in trees
• The \((-1)\)-critical tournaments
• Les Tournois (−1)‐Chaîne

This page was built for publication: The \((-1)\)-critically duo-free tournaments.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804812)