1 votes 1 votes The Chromatic number of the following graph is _________ Graph Theory go2025-mix-3 numerical-answers graph-coloring + – gatecse asked Oct 15, 2020 • recategorized Oct 15, 2020 by Lakshman Bhaiya gatecse 72 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes The Chromatic number $\chi{(G)}$ is the least $k$, such that $G$ is $k-$colorable. Chromatic number $\chi{(G)}=3$. gatecse answered Oct 15, 2020 • selected Oct 9, 2021 by Arjun gatecse comment Share Follow See all 3 Comments See all 3 3 Comments reply Abhisheksmile94 commented Oct 19, 2020 reply Follow Share in this type of questions from which node we should start because i started with some node and was getting 4 . please help 0 votes 0 votes JashanArora commented Nov 16, 2020 reply Follow Share Finding the chromatic number is an NP complete problem. You have to have slight intuition, which only comes by practice. Anyhow, this is the famous Peterson’s graph which has the chromatic number 3. 1 votes 1 votes anas_2908 commented Oct 22, 2022 reply Follow Share would suggest you to start from subgraphs having triangle that is K3 graphs since all the vertices will have different color therefore easy to guess 0 votes 0 votes Please log in or register to add a comment.
