The \(\{-2,-1\}\)-selfdual and decomposable tournaments
From MaRDI portal
Publication:1649912
DOI10.7151/dmgt.2059zbMath1391.05121OpenAlexW2794035839MaRDI QIDQ1649912
Pierre Ille, Youssef Boudabbous
Publication date: 29 June 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2059
Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Indecomposability graph and critical vertices of an indecomposable graph
- \(P_ 4\)-trees and substitution decomposition
- Strongly self-complementary and hereditarily isomorphic tournaments
- The \(C_{3}\)-structure of the tournaments.
- Sur la répartition des diamants dans un tournoi. (On the repartition of diamonds in a tournament).
- Indecomposability and duality of tournaments
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Morphology of the \((-1)\)-critical tournaments
- On the problem of reconstructing a tournament from subtournaments
- Automorphism groups of designs
- The {-3}-reconstruction and the {-3}-self duality of tournaments
- Cut-primitive directed graphs versus clan-primitive directed graphs
- Erratum to: “The falsity of the reconstruction conjecture for tournaments”
- Graph reconstruction—a survey
- L'Indeformabilite des Relations et Multirelations Binaires
- Tournaments whose Subtournaments are Irreducible or Transitive
- Self-Converse Tournaments
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The \(\{-2,-1\}\)-selfdual and decomposable tournaments