Register

Graph Theory

316 views
0 0 votes

 

A vertex colouring with three colours of a graph G = (V, E) is a mapping V → {R, G, B }. So that any two adjacent vertices does not same colour. Consider the below graphs:

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Consider the followi...Next → · GO Classes DA | Week...
← Previous in category · IIIT Delhi Coding qu...Next in category → · ISRO CSE 2023 | Ques...
Position:
Show:

Related questions

0 0 votes
1 1 answer
78
78 views
Nitish0908 asked Jul 5
78 views
graph theory
Maximum number of edges in a simple graph G on n vertices and no even cycleis:
9 9 votes
1 1 answer
673
673 views
GO Classes asked May 27
673 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does there exist a simple Eulerian graph on 6 vertices and 7 edges.Enter $1$ for Yes and $0$ for No.
3 3 votes
2 2 answers
378
378 views
GO Classes asked May 27
378 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Does the following graph have a Hamiltonian cycle? Enter $1$ for Yes and $0$ for No.  
3 3 votes
1 1 answer
389
389 views
GO Classes asked May 27
389 views
GO Classes DPP | GATE CS | Discrete Mathematics | Graph Theory
Is the following graph Hamiltonian? Enter $1$ for Yes and $0$ for No.