1 votes 1 votes Graph Theory graph-theory discrete-mathematics graph-coloring + – Abhijeet_Kumar asked Dec 23, 2017 Abhijeet_Kumar 704 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Raveena Yadav 1 commented Dec 23, 2017 reply Follow Share 8 vertices 0 votes 0 votes Abhijeet_Kumar commented Dec 23, 2017 reply Follow Share no . 0 votes 0 votes Pawan Kumar 2 commented Dec 23, 2017 reply Follow Share 4 * 35*2 ? 0 votes 0 votes Abhijeet_Kumar commented Dec 23, 2017 reply Follow Share wrong 0 votes 0 votes Ajay Jadhav commented Dec 23, 2017 reply Follow Share Is 48 solution? 0 votes 0 votes Raveena Yadav 1 commented Dec 23, 2017 reply Follow Share then what's the answer ? 0 votes 0 votes Abhijeet_Kumar commented Dec 23, 2017 reply Follow Share answer is 216 0 votes 0 votes Raushank2 commented Dec 23, 2017 reply Follow Share how? can you explain? 0 votes 0 votes Manu Thakur commented Dec 23, 2017 reply Follow Share The inner complete graph k4 need 4 color and we can color these vertices in $4! = 24$ ways. for outer rectangle we have 9 choices. so total $24*9 = 216$ ways we can color this graph. 6 votes 6 votes Please log in or register to add a comment.
