A Perfect Coloring of a Graph G With M Color (a Perfect Mcoloring) Is a Surjective Mapping P : V (G) → {1, 2, . . . , M} Such Thateach Vertex of Color I Has Exactly Mij Neighbors of Color J, for All I, j,where M = (mij )i,j=1,2,. ,m Is the Corresponding Matrix. In This paper,we Classify Perfect 2-Colorings of the Bicubic Graphs With Order up to 12. Punjab Univ. J. Math. 2025, 52 (8), 17-25.