The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
193 views

in Graph Theory by Loyal (7.7k points) | 193 views

1 Answer

0 votes

{V1},{V2,V4},{V3,V5} is the only chromatic partitioning possible into 3 different subsets of vertices.

by Loyal (7.7k points)
0
What is chromatic partitioning?
0
Given a simple connected graph G,partitioning all the vertices into smallest possible number of disjoint independent set is know as chromatic partitioning.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,362 questions
55,786 answers
192,410 comments
90,918 users