✦ LIBER ✦

Perfect codes in graphs

✍ Scribed by Norman Biggs

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 396 KB
Volume: 15
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90042-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect codes in the graphs Ok

✍ P Hammond; D.H Smith 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 881 KB

On perfect arithmetic codes

✍ Antoine C. Lobstein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Lobstein, A.C., On perfect arithmetic codes, Discrete Mathematics 106/107 (1992) 333-336 This short paper treats the perfect codes, in the case of arithmetic codes and Garcia-Rao modular distance.

A generalization of perfect graphs?i-per

A generalization of perfect graphs?i-perfect graphs

✍ Cai, Leizhen; Corneil, Derek 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc

Critical perfect graphs and perfect 3-ch

Critical perfect graphs and perfect 3-chromatic graphs

✍ Alan Tucker 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Cycle-perfect graphs are perfect

✍ Le, Van Bang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB 👁 2 views

The cycle graph of a graph G is the edge intersection graph of the set of all the induced cycles of G. G is called cycle-perfect if G and its cycle graph have no chordless cycles of odd length at least five. We prove the statement of the title. 0 1996 John Wiley &

Embedding in a perfect code

✍ Sergey V. Avgustinovich; Denis S. Krotov 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB