A Short Proof that Every Claw-Free Cubic Graph is (1,1,2,2)-Packing Colorable
Abstract
It was recently proved that every claw-free cubic graph admits a (1, 1, 2, 2)-packing coloring--that is, its vertex set can be partitioned into two 1-packings and two 2-packings. This result was established by Bresar, Kuenzel, and Rall [Discrete Mathematics 348 (8) (2025), 114477]. In this paper, we provide a simpler and shorter proof.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.