Register

Graph Theory

173 views
0 votes
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:

User Avatar

Please log in or register to answer this question.

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

Related questions

236
views
1 answers
1 votes
suryansh rajput asked Oct 2, 2023
236 views
Graph Theory
User Avatar
233
views
1 answers
0 votes
gagan55 asked Jun 30, 2023
233 views
Graph theory self doubt
Number of hamiltonian cycles for a graph K 5, 5( bipartite graph ) ??
User Avatar
581
views
1 answers
0 votes
Dhiraj_777 asked May 4, 2023
581 views
Planar Graphs | Graph Theory | Selfdoubt
In a Connected Planar Bipartite Graph of order 10 atmost how many edges be present ?
User Avatar
549
views
1 answers
0 votes
Sahil_Lather asked Apr 15, 2023
549 views
Byju's graph theory coloring question
Graph G is obtained by adding vertex s to $K_{3,4}$ and making s adjacent to every vertex of $K_{3,4}$ .The find the minimum number of colours required ot edge-colour is ?
User Avatar
Link Copied!