collaborators

1 paper

math.CO2025

A Short Proof that Every Claw-Free Cubic Graph is (1,1,2,2)-Packing Colorable

Maidoun Mortada, Ayman El Zein

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. T…