On perfect 2-colorings of Johnson graphs J(v, 3)

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	232-252
Number of pages	21
Journal	Journal of Combinatorial Designs
Volume	21
Issue number	6
DOIs	https://doi.org/10.1002/jcd.21327
Publication status	Published - Jun 2013

completely regular code, distance-regular graph, equitable partition, Johnson graph, perfect coloring

ID: 906535