Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
From MaRDI portal
Publication:1279873
DOI10.1006/eujc.1998.0256zbMath0917.05075OpenAlexW2006226241MaRDI QIDQ1279873
Publication date: 17 February 1999
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1998.0256
Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24)
Related Items (9)
A note on decompositions of transitive tournaments ⋮ On colorful edge triples in edge-colored complete graphs ⋮ Transitive tournaments and self-complementary graphs ⋮ A note on an embedding problem in transitive tournaments ⋮ Partitioning transitive tournaments into isomorphic digraphs ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ Algorithms for finding maximum transitive subtournaments ⋮ Local chromatic number and Sperner capacity ⋮ Relations between the Local Chromatic Number and Its Directed Version
This page was built for publication: Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
