Perfect 2-colorings of the cubic graphs of order less than or equal to 10
DOI10.1016/J.AKCEJ.2018.11.004zbMATH Open1473.05080OpenAlexW2904803826MaRDI QIDQ5154602FDOQ5154602
Authors: 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
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Linear codes (general theory) (94B05)
Cites Work
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Perfect 2-colorings of the generalized Petersen graph
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- Title not available (Why is that?)
- On perfect 2-colorings of Johnson graphs \(J(v, 3)\)
- Compact graphs and equitable partitions
- Title not available (Why is that?)
- Perfect 3-colorings of the cubic graphs of order 10
- Title not available (Why is that?)
Cited In (13)
- Perfect 2-colorings of \(C_n \times C_m\)
- Title not available (Why is that?)
- 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
- Perfect 2‐colorings of Hamming graphs
- On perfect colorings of the halved 24-cube
- 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)
