scientific article; zbMATH DE number 19207
From MaRDI portal
Publication:3976637
zbMATH Open0763.05085MaRDI QIDQ3976637FDOQ3976637
Authors: Michael D. Plummer 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- A note on cyclic connectivity and matching properties of regular graphs
- Edge proximity conditions for extendability in regular bipartite graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- Maximum matchings in a regular graph of specified connectivity and bounded order
- Extendability and criticality in matching theory
Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (18)
- Matching and edge-connectivity in regular graphs
- Extending matchings to 2-factors
- Title not available (Why is that?)
- On matching extensions with prescribed and proscribed edge sets. II
- Matchings and matching extensions in graphs
- A note on cyclic connectivity and matching properties of regular graphs
- Matching extension and the genus of a graph
- Paths and cycles concerning independence edges
- Pseudo 2-factor isomorphic regular bipartite graphs
- Perfect matchings of regular bipartite graphs
- Matching connectivity: on the structure of graphs with perfect matchings
- Generalization of matching extensions in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending matchings in graphs: A survey
- Matching extension in prism graphs
- Edge proximity conditions for extendability in regular bipartite graphs
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976637)
