A closure concept in factor-critical graphs

DOI10.1016/S0012-365X(02)00303-5MaRDI QIDQ1861227zbMATH OpenOpenAlexFDO

Authors Tsuyoshi Nishimura

Publication date 16 March 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(02)00303-5

zbMATH Keywords

1-factorsclosuresfactor-critical graphs

Mathematics Subject Classification ID

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

Recommendations

• Closure and factor-critical graphs
• A note on \(m\)-near-factor-critical graphs
• Factor criticality and complete closure of graphs
• A note on extendability and factor-criticality
• On k-factor-critical graphs

Cited in

(6)

• Factor criticality and complete closure of graphs
• A formal context for closures of acyclic hypergraphs
• scientific article; zbMATH DE number 1854040 (Why is no real title available?)
• Minimally k-factor-critical graphs for some large k
• Minimum degree of minimal (n-10)-factor-critical graphs
• Perfect k-matching, k-factor-critical and A_-spectral radius

This page was built for publication: A closure concept in factor-critical graphs

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