Linear-time implementation of the last-vertex recognition scheme
Establish whether the recognition scheme that guesses the last vertex to become incident to a red edge can be implemented in linear time with further arguments.
References
However, we do not exclude the possibility that the scheme of the previous algorithm can be implemented in linear time with some further arguments.
— Twin-width one
(2501.00991 - Ahn et al., 2 Jan 2025) in Section 1, Introduction, paragraph beginning “Regarding the challenge of avoiding…”
Claw-connected graphs with maximum degree exactly~3 are left as an open problem for future work. If such graphs also admit a linear-time checkable winning condition, the unbiased claw game can be solved in linear time, see also \cref{cor:decomp_alg}.
— A Linear-Time Algorithm for the Unbiased Claw Game on Graphs with Maximum Degree 4
(2610.21878 - Brinkmann, 15 Oct 2026) in Section 3, Section 5, and Section 6 (Open Problems and Future Work); see also Corollary 5.6