Dvořáková-Rulićová, I. Perfect codes in regular graphs. (English) Zbl 0691.05054 Commentat. Math. Univ. Carol. 29, No. 1, 79-83 (1988). Summary: We prove that for any finite set M of positive integers and for any graph G with maximum degree d, G is an introduced subgraph of a \((d+1)\)-regular graph containing t-perfect codes for every \(t\in M\). Cited in 1 Document MSC: 05C99 Graph theory 94B25 Combinatorial codes Keywords:regular graph; perfect codes PDFBibTeX XMLCite \textit{I. Dvořáková-Rulićová}, Commentat. Math. Univ. Carol. 29, No. 1, 79--83 (1988; Zbl 0691.05054)