Generalization of matching extensions in graphs. III
From MaRDI portal
(Redirected from Publication:534332)
Recommendations
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 1471076 (Why is no real title available?)
- scientific article; zbMATH DE number 238423 (Why is no real title available?)
- A characterization of maximal non-\(k\)-factor-critical graphs
- Generalization of matching extensions in graphs
- Generalization of matching extensions in graphs. II.
- Graph theory with applications
- On (n,k)-extendable graphs and induced subgraphs
- On \(k\)-factor-critical graphs
- On n-extendable graphs
Cited in
(10)- Generalization of matching extensions in graphs. II.
- Extending matchings in odd graphs
- The matching extension problem in general graphs is co-NP-complete
- Matching extension and the genus of a graph
- scientific article; zbMATH DE number 6746903 (Why is no real title available?)
- Minimal graphs for 2-factor extension
- Generalization of matching extensions in graphs. IV: Closures
- Minimal graphs for matching extensions
- Generalization of matching extensions in graphs
- On three extensions of equimatchable graphs
This page was built for publication: Generalization of matching extensions in graphs. III
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534332)