Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching

Frantisek Kardos, Edita Mácajová, Jean Paul Zerafa. Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching. J. Comb. Theory, Ser. B, 160:1-14, May 2023. [doi]

Authors

Frantisek Kardos

This author has not been identified. Look up 'Frantisek Kardos' in Google

Edita Mácajová

This author has not been identified. Look up 'Edita Mácajová' in Google

Jean Paul Zerafa

This author has not been identified. Look up 'Jean Paul Zerafa' in Google