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

DOI10.1016/j.jctb.2022.12.003zbMath1510.05241arXiv2204.10021MaRDI QIDQ6397067

Edita Máčajová, Jean Paul Zerafa, František Kardoš

Publication date: 21 April 2022

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)