Four-perfect-matching covers of bridgeless claw-free cubic graphs
Determine whether every bridgeless claw-free cubic graph can be covered by four perfect matchings.
References
It remains open whether every bridgeless claw-free cubic graph can be covered by four perfect matchings.
— Perfect matching covers of claw-free cubic graphs
(2610.01137 - Zhou et al., 1 Oct 2026) in Section 1, paragraph following Theorem 1.3