Let G and H be two graphs (not necessarily edge disjoint). Prove that $\chi '(G \cup H) \leq \chi ' (G) + \chi ' (H)$.
Here $\chi '$ represents the edge chromatic number. Not sure where to start with this really. Any help appreciated.
Let G and H be two graphs (not necessarily edge disjoint). Prove that $\chi '(G \cup H) \leq \chi ' (G) + \chi ' (H)$.
Here $\chi '$ represents the edge chromatic number. Not sure where to start with this really. Any help appreciated.
Copyright © 2021 JogjaFile Inc.