A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph

Takamasa Yashima, Kenta Ozeki, Christopher Purcell, Kenji Kimura, Roman Čada, Michitaka Furuya

Publication date: 15 November 2023

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph