Register

graph theory

1,049 views

1 Answer

0 votes
0 votes

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

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Sourajit25 asked Dec 25, 2017
593 views
Graph Theory Doubt
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are : a)24 b)37 c)7 d)10 Answer given : 7 How to solve this ? Is there any formulae for number of regions calculation? The only one I know is r=e-n+2 for any planar graph.
Let G be a planar graph with 7 vertices, 10 edges and 3 components then the number of regions are :a)24b)37c)7d)10Answer given : 7How to solve this ? Is there any formula...
User Avatar
0 votes
0 votes
0 answers
2
Pavan Kumar Munnam asked May 12, 2017
390 views
Graph Theory
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
User Avatar
3 votes
3 votes
3 answers
3
Vicky rix asked Apr 7, 2017
1,437 views
graph theory
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...
User Avatar
1 votes
1 votes
4 answers
4
Vicky rix asked Mar 11, 2017
3,444 views
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
User Avatar
Link Copied!