Register

Proper edge coloring

2,001 views
0 0 votes
What is the minimal number K such that there exists a proper edge coloring of the complete graph on 8 vertices with K colors?

A) 28                  B) 8             C) 7                          D) 15

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · KenethNext → · Compiler design
← Previous in category · KenethNext in category → · Connectivity(4-10)-N...
Position:
Show:

Related questions

0 0 votes
0 0 answers
1.2k
1.2k views
Parshu gate asked Nov 5, 2017
1,196 views
GRAPH THEORY EDGE COLORING
3 3 votes
5 answers 5 answers
647
647 views
GO Classes asked Jun 9, 2025
647 views
GO Classes DPP | Graph Theory | Graph Coloring | Princeton University
What is the chromatic number for the graph?3456
1 1 vote
1 1 answer
943
943 views
Sahil_Lather asked Apr 15, 2023
943 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 ...
2 2 votes
1 1 answer
827
827 views
Na462 asked Jan 16, 2019
827 views
MadeEasy Subject Test 2019: Graph Thoery - Graph Coloring
The number of vertices,edges and colors required for proper coloring in Tripartite graph K<3,2,5 will be :10 , 31 , 310 , 30 , 310 , 30 , 2None