Permutation capacity of graphs, paper in preparation ,
On the capacity of the arbitrarily varying channel for maximum probability of error, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.4, issue.1, pp.87-101, 1981. ,
DOI : 10.1007/BF00533715
Information theory: Coding theorems for discrete memoryless systems, and Akadémiai Kiadó, 1981. ,
DOI : 10.1017/CBO9780511921889
Pairwise colliding permutations and the capacity of infinite graphs, SIAM Journal on Discrete Mathematics, vol.20, issue.1, pp.203-212, 2006. ,
DOI : 10.1137/050632877
Graph-Different Permutations, SIAM Journal on Discrete Mathematics, vol.22, issue.2, pp.489-499, 2008. ,
DOI : 10.1137/070692686
On the Shannon capacity of a graph, IEEE Transactions on Information Theory, vol.25, issue.1, pp.1-7, 1979. ,
DOI : 10.1109/TIT.1979.1055985
Distance Graphs with Finite Chromatic Number, Journal of Combinatorial Theory, Series B, vol.85, issue.1, pp.181-187, 2002. ,
DOI : 10.1006/jctb.2001.2093
Fractional Graph Theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1997. ,
The zero error capacity of a noisy channel, IEEE Transactions on Information Theory, vol.2, issue.3, pp.8-19, 1956. ,
DOI : 10.1109/TIT.1956.1056798