Strongly self-complementary and hereditarily isomorphic tournaments

DOI10.1007/BF01387756zbMath0335.05112OpenAlexW2022940994MaRDI QIDQ1229221

Carsten Thomassen, K. Brooks Reid

Publication date: 1976

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177761

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

The \(\{-2,-1\}\)-selfdual and decomposable tournaments ⋮ Prime orders all of whose prime suborders are selfdual ⋮ Prechains and self duality ⋮ The pairs of \(\{-3\}\)-hypomorphic tournaments ⋮ The \((\leq 5)\)-hypomorphy of digraphs up to complementation ⋮ Unnamed Item ⋮ Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments ⋮ Half-isomorphy, selfduality and finite non strongly connected tournaments ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the problem of reconstructing a tournament from subtournaments
• On nonreconstructable tournaments

This page was built for publication: Strongly self-complementary and hereditarily isomorphic tournaments