Claw-Free Vertex Splitting NP-Complete, Solvable for Degree‑4 Graphs

Making a graph claw‑free by exclusive vertex splits is NP‑complete, but solvable in polynomial time when the maximum degree ≤4. The paper was submitted on 6 June 2025. Read more: getnews.me/claw-free-vertex-splitti... #clawfree #npcomplete