0 votes 0 votes Graph Theory graph-theory discrete-mathematics graph-connectivity engineering-mathematics + – Vicky rix asked Mar 12, 2017 Vicky rix 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes {V1},{V2,V4},{V3,V5} is the only chromatic partitioning possible into 3 different subsets of vertices. Vicky rix answered Mar 12, 2017 Vicky rix comment Share Follow See all 3 Comments See all 3 3 Comments reply smsubham commented Dec 19, 2017 reply Follow Share What is chromatic partitioning? 0 votes 0 votes BASANT KUMAR commented Jul 7, 2019 reply Follow Share Given a simple connected graph G,partitioning all the vertices into smallest possible number of disjoint independent set is know as chromatic partitioning. 0 votes 0 votes kunal goswami commented Dec 12, 2019 reply Follow Share Ans. Given at many place is 1 0 votes 0 votes Please log in or register to add a comment.