A larger class of reconstructible tournaments
From MaRDI portal
Publication:1917492
DOI10.1016/0012-365X(94)00300-8zbMath0852.05051WikidataQ127391053 ScholiaQ127391053MaRDI QIDQ1917492
Publication date: 25 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Either tournaments or algebras?
- On the problem of reconstructing a tournament from subtournaments
- Hamiltonian tournaments with the least number of 3-cycles
- The falsity of the reconstruction conjecture for tournaments
- Tournaments whose Subtournaments are Irreducible or Transitive
- Tournaments That Admit Exactly One Hamiltonian Circuit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item