Minimal graphs for 2-factor extension

DOI10.1016/J.DAM.2019.11.022MaRDI QIDQ2185731zbMATH OpenOpenAlexWikidataFDO

Authors Marie-Christine Costa, Dominique De Werra, 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

2-factorminimum expandable graphreliability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 718668
• Extending matchings to 2-factors
• scientific article; zbMATH DE number 6096657
• scientific article; zbMATH DE number 871171
• A note onn-extendable graphs

Cites work

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

Cited in

(2)

• Hamiltonian extendable graphs
• Minimum number of components of 2-factors in iterated line graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185731)