prove that any graph with maximum degree d ≥ 1 can be edge colored with 2d −1 colors.
A. True
B. False
C. Cannot be determined
D. Depends on the graph structure