Perfect 2-colorings of the cubic graphs of order less than or equal to 10
From MaRDI portal
Publication:5154602
DOI10.1016/j.akcej.2018.11.004zbMath1473.05080OpenAlexW2904803826MaRDI QIDQ5154602
Mehdi Alaeiyan, Ayoob Mehrabani
Publication date: 5 October 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2018.11.004
Linear codes (general theory) (94B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Perfect 2-colorings of the generalized Petersen graph
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Perfect 2-colorings of the cubic graphs of order less than or equal to 10