0
$\begingroup$

My attempted proof:

  • We know that every bipartite graph $G$ has $\chi{'}(G) = \Delta(G)$
  • And then i showed that every tree is a bipartite graph by induction on the number of vertices in T.

T denoting a tree. $\chi^{'}$ denoting the chromatic index.

Is This a correct approach ?

  • 0
    AFAIS $T$ is a tree, but anyway you need to write this explicitly. And what is $\chi'$? – 2017-02-06
  • 0
    It's the chromatic index – 2017-02-06
  • 0
    There are a bunch of things in math that are denoted by $\Delta,\chi$ or $T$. How do you expect for others to understand what is stated here? – 2017-02-06
  • 0
    Yes, your approach is correct. – 2017-02-06
  • 0
    @Wolfram i realize that, my apologies. I edited the post. – 2017-02-06

0 Answers 0