Perfect 2-colorings of the cubic graphs of order less than or equal to 10
From MaRDI portal
Publication:5154602
Recommendations
Cites work
- scientific article; zbMATH DE number 5379405 (Why is no real title available?)
- scientific article; zbMATH DE number 3503313 (Why is no real title available?)
- scientific article; zbMATH DE number 7009673 (Why is no real title available?)
- A bound on correlation immunity
- Compact graphs and equitable partitions
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Perfect 2-colorings of the generalized Petersen graph
- Perfect 3-colorings of the cubic graphs of order 10
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
Cited in
(13)- Perfect 2-colorings of \(C_n \times C_m\)
- scientific article; zbMATH DE number 7009673 (Why is no real title available?)
- Perfect 3-colorings of the cubic graphs of order 10
- Perfect 3-colorings of prism and Möbius ladder graphs
- Perfect colorings of regular graphs
- On perfect 2-colorings of the hypercube
- On perfect colorings of the halved 24-cube
- Perfect 2‐colorings of Hamming graphs
- Perfect 2-coloring of the quartic graphs with order at most 8
- Perfect orientation colorings of cubic graphs
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- Perfect 2-colorings of the Platonic graphs
- Perfect 2-colorings of the generalized Petersen graph \(GP(n,3)\)
This page was built for publication: Perfect 2-colorings of the cubic graphs of order less than or equal to 10
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154602)