Minimal graphs for 2-factor extension

DOI10.1016/j.dam.2019.11.022zbMath1441.05180OpenAlexW2997755348WikidataQ126426941 ScholiaQ126426941MaRDI QIDQ2185731

Dominique de Werra, Marie-Christine Costa, Christophe Picouleau

Publication date: 5 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.11.022

zbMATH Keywords

reliability2-factorminimum expandable graph

Mathematics Subject Classification ID

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

Related Items (1)

Hamiltonian extendable graphs

Cites Work

• Unnamed Item
• Extensions to 2-factors in bipartite graphs
• Generalization of matching extensions in graphs. III
• Matching theory
• Extending matchings in graphs: A survey
• Minimal graphs for matching extensions
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)

This page was built for publication: Minimal graphs for 2-factor extension