When a decomposable tournament is \-1,3\-reconstructible?

DOI10.1007/S00373-025-02888-8MaRDI QIDQ7011827zbMATH OpenFDO

Authors P. Ille, Soufiane Lakhlifi

Publication date 18 March 2025

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00373-025-02888-8

zbMATH Keywords

decomposablereconstructionselfdualtournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• \(P_ 4\)-trees and substitution decomposition
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• scientific article; zbMATH DE number 417290 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
• On Convex Subsets in Tournaments
• On the problem of reconstructing a tournament from subtournaments
• On the reconstruction index of permutation groups: semiregular groups.
• Sur la (-k)-demi-reconstructibilité des tournois finis
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• The \(C_{3}\)-structure of the tournaments.
• The falsity of the reconstruction conjecture for tournaments
• Tournaments whose Subtournaments are Irreducible or Transitive
• Transitiv orientierbare Graphen

This page was built for publication: When a decomposable tournament is \(\{-1,3\}\)-reconstructible?

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