Closure and factor-critical graphs

DOI10.1016/S0012-365X(99)00234-4zbMath0951.05084OpenAlexW2024842496MaRDI QIDQ1974532

Akira Saito, Michael D. Plummer

Publication date: 13 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00234-4

zbMATH Keywords

perfect matchingHamiltonian graphsmatching extensionfactor-critical

Mathematics Subject Classification ID

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

Related Items (5)

Generalization of matching extensions in graphs. IV: Closures ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Some results on fractional \(n\)-factor-critical graphs ⋮ Closure, stability and iterated line graphs with a 2-factor

This page was built for publication: Closure and factor-critical graphs