Zobrazeno 1 - 1
of 1
pro vyhledávání: '"05C15 (Primary) 05C75 (Secondary)"'
The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect $0$, those that cannot be $3$-edge-coloured (that is, snarks) are known to have d
Externí odkaz:
http://arxiv.org/abs/2308.13639
