On the regularity of perfect 2-colorings of the Johnson graph

DOI10.1134/S0032946007040035zbMath1143.05031MaRDI QIDQ941880

Ivan Yu. Mogilnykh

Publication date: 2 September 2008

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Johnson graphperfect codesperfect coloringk-regular

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Combinatorial codes (94B25)

Related Items (6)

Perfect 3-colorings of the Johnson graph \(J(6, 3)\) ⋮ Perfect 2-colorings of the Johnson graph \(J(9, 4)\) ⋮ Perfect 2-coloring of the quartic graphs with order at most 8 ⋮ On completely regular codes ⋮ On Perfect 2‐Colorings of Johnson Graphs J(v, 3) ⋮ Perfect colorings of regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Perfect Constant-Weight Codes
• Perfect Single Error-Correcting Codes in the Johnson Scheme
• On perfect codes and related concepts

This page was built for publication: On the regularity of perfect 2-colorings of the Johnson graph