Previous |  Up |  Next

Article

Title: Perfect codes in graphs and their Cartesian powers [Abstract of thesis] (English)
Author: Kratochvíl, Jan
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 30
Issue: 1
Year: 1989
Pages: 193-194
.
Category: math
.
MSC: 05C99
MSC: 94B60
idZBL: Zbl 0709.94632
.
Date available: 2008-06-05T21:37:31Z
Last updated: 2012-04-28
Stable URL: http://hdl.handle.net/10338.dmlcz/106723
.
Reference: [1] Angluin D.: Local and global properties in networks of processors.Proceedings 12th Annual ACM Symposium on Theory of Computing (1980).
Reference: [2] Biggs N. L.: Algebraic Graph Theory.Cambridge Univ. Press, 1974. Zbl 0284.05101, MR 0347649
Reference: [3] Biggs N. L.: Perfect codes in graphs.J. Combin. Theory Ser. B 15 (1973), 289-296. Zbl 0256.94009, MR 0325457
Reference: [4] Best M. R.: Perfect codes hardly exist.IEEE Trans. Inform. Theory 29 (1983), 349-351. Zbl 0517.94013, MR 0712395
Reference: [5] Dvořáková, Ruličová L.: Perfect codes in regular graphs.Comment. Math. Univ. Carolinae 29 (1988), 79-83. MR 0937551
Reference: [6] Fellows M., Hoover M.: Perfect domination.Tech. Report CS86-7. Dept. of Comp. Sci., Univ. New Mexico, Albuquerque 1987.
Reference: [7] Hammond P., Smith D. H.: Perfect codes in the graphs $O_k$.J. Combin. Theory Ser. B 19 (1975), 239-255. Zbl 0282.94007, MR 0414437
Reference: [8] Kartochvíl J.: Perfect codes over graphs.J. Combin.Theory Ser. B 40 (1986), 224-228. MR 0838221
Reference: [9] Kratochvíl J.: Perfect codes in general graphs.to appear in Proceedings VIIth Hungarian colloqium on combinatorics, Eger 1987. MR 1141598
Reference: [10] Kratochvíl J.: One-perfect codes over self-complementary graphs.Comment. Math. Univ. Carolinae 26 (1985), 589-595. MR 0817829
Reference: [11] Kratochvíl J., Křivánek M.: On the computational complexity of codes in graphs.Proc. MFCS '88, Lecture Notes in Comp. Sci. 324, Springer-Verlag, Berlin (1988), 396-404. MR 1023443
Reference: [12] Kratochvíl J., Malý J., Matoušek J.: On the existence of perfect codes in a random graph.to appear in Proceedings Random Graphs '87, Poznań (1987).
Reference: [13] Kratochvíl J.: Perfect codes and two-graphs.submitted
Reference: [14] Smith D. H.: Perfect codes in the graphs $O_k$ and $L(O_k)$.Glasgow Math. J. 21 (1980), 169-172. Zbl 0432.05048, MR 0582126
Reference: [15] Tietäväinen A.: On the nonexistence of perfect codes over finite fields.SIAM J. Appl. Math. 24 (1973), 88-96. MR 0325260
.

Files

Files Size Format View
CommentatMathUnivCarol_030-1989-1_26.pdf 294.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo