Perfect 3-colorings of the Johnson graph J(6, 3)
From MaRDI portal
Publication:826569
Recommendations
- Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph.
- On the regularity of perfect 2-colorings of the Johnson graph
- On nonexistence of some perfect 2-colorings of Johnson graphs
- Perfect 2-colorings of the Johnson graph \(J(9, 4)\)
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
Cites work
- Completely regular designs of strength one
- On \(r\)-partition designs in Hamming spaces
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- On the regularity of perfect 2-colorings of the Johnson graph
- On weight distributions of perfect colorings and completely regular codes
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph.
Cited in
(6)- Symmetric perfect 2-colorings of \(J(10,3)\)
- Induced perfect colorings
- Perfect \(3\)-colorings of the Johnson graphs \(J(4,2)\), \(J(5,2)\), \(J(6,2)\) and Petersen graph.
- Decomposition of the Johnson graphs into graph-pairs of order 4
- Perfect 3-colorings on 6-regular graphs of order 9
- Perfect 2-colorings of \(C_n \times C_m\)
This page was built for publication: Perfect 3-colorings of the Johnson graph \(J(6, 3)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826569)