4 votes 4 votes What is the minimal number $k$ such that there exists a proper edge coloring (chromatic index) of the complete graph on $6$ vertices with $k$ colors? Graph Theory go2025-dm-4 numerical-answers graph-coloring + – gatecse asked Sep 14, 2020 • recategorized Sep 14, 2020 by Lakshman Bhaiya gatecse 282 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes $\implies$The edge chromatic number of a graph must be at least as large as the maximum degree of a vertex of the graph. Minimal number $k=5$. So, the correct answer is $5$. gatecse answered Sep 14, 2020 • selected Sep 11, 2021 by Arjun gatecse comment Share Follow See 1 comment See all 1 1 comment reply gaurav_kumar commented Jan 1 reply Follow Share was looking for some proofs of this got this helpful read: https://faculty.etsu.edu/gardnerr/5347/Beamer-Pearls/Proofs-Pearls-2-2.pdf 1 votes 1 votes Please log in or register to add a comment.
