Register

MadeEasy Subject Test 2019: Graph Thoery - Graph Coloring

• edited by
515 views
2 votes
2 votes

The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5> will be :

  1. 10 , 31 , 3
  2. 10 , 30 , 3
  3. 10 , 30 , 2
  4. None
• edited by
User Avatar

1 Answer

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

Related questions

0 votes
0 votes
1 answer
1
snaily16 asked Jan 19, 2019
2,214 views
MadeEasy Test Series: Discrete Mathematics - Graph Thoery
The number of labelled subgraphs possible for the graph given below.
The number of labelled subgraphs possible for the graph given below.
User Avatar
8 votes
8 votes
2 answers
3
kapilbk1996 asked Jan 11, 2018
759 views
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.
User Avatar
Link Copied!