Two recursive theorems on \(n\)-extendibility

DOI10.1016/0012-365X(95)00298-BzbMath0870.05058OpenAlexW2078783097MaRDI QIDQ1356686

Akira Saito, Tsuyoshi Nishimura

Publication date: 10 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00298-b

zbMATH Keywords

perfect matching\(n\)-extendible graphs

Mathematics Subject Classification ID

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

Related Items (1)

A new recursive theorem on \(n\)-extendibility

Cites Work

• On n-extendable graphs
• Graphs with 1-Factors
• Unnamed Item
• Unnamed Item

This page was built for publication: Two recursive theorems on \(n\)-extendibility