Perfect 3-colorings of the Johnson graph \(J(6, 3)\)

DOI10.1007/s41980-019-00346-9zbMath1451.05072OpenAlexW3004084703MaRDI QIDQ826569

Mehdi Alaeiyan, Amirabbas Abedi, Mohammadhadi Alaeiyan

Publication date: 5 January 2021

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-019-00346-9

zbMATH Keywords

Johnson graphbreakingmergingperfect 3-colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On weight distributions of perfect colorings and completely regular codes
• On the regularity of perfect 2-colorings of the Johnson graph
• On \(r\)-partition designs in Hamming spaces
• Completely regular designs of strength one
• Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
• On Perfect 2‐Colorings of Johnson Graphs J(v, 3)

This page was built for publication: Perfect 3-colorings of the Johnson graph \(J(6, 3)\)