Perfect 3-colorings on 6-regular graphs of order 9
From MaRDI portal
Publication:2316946
DOI10.1007/s11464-019-0768-6zbMath1417.05074OpenAlexW2946058289WikidataQ127870268 ScholiaQ127870268MaRDI QIDQ2316946
Yunfeng Zhao, Ziqiu Liu, Yu-Qin Zhang
Publication date: 7 August 2019
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-019-0768-6
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Compact graphs and equitable partitions
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- Perfect 3-colorings of the cubic graphs of order 10
This page was built for publication: Perfect 3-colorings on 6-regular graphs of order 9