On 1-factors and matching extension

DOI10.1016/S0012-365X(00)00057-1MaRDI QIDQ1579574zbMATH OpenOpenAlexFDO

Authors Tsuyoshi Nishimura

Publication date 14 September 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00057-1

zbMATH Keywords

1-factor\(k\)-extendable\(k\)-factor-criticalmatching

Mathematics Subject Classification ID

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

Recommendations

• On (n,k)-extendable graphs and induced subgraphs
• scientific article; zbMATH DE number 1150355
• Matchings and matching extensions in graphs
• Extendability and factor-criticality
• scientific article; zbMATH DE number 2197893

Cited in

(4)

• A note on extendability and factor-criticality
• Some results on fractional n-factor-critical graphs
• scientific article; zbMATH DE number 1150355 (Why is no real title available?)
• The maximum matching extendability and factor-criticality of 1-planar graphs

This page was built for publication: On 1-factors and matching extension

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