scientific article; zbMATH DE number 19207
From MaRDI portal
Publication:3976637
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
Cited in
(18)- Matching and edge-connectivity in regular graphs
- Extending matchings to 2-factors
- scientific article; zbMATH DE number 4066957 (Why is no real title available?)
- 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
- Matching connectivity: on the structure of graphs with perfect matchings
- Perfect matchings of regular bipartite graphs
- Generalization of matching extensions in graphs
- scientific article; zbMATH DE number 6828923 (Why is no real title available?)
- Matching extension in prism graphs
- Extending matchings in graphs: A survey
- scientific article; zbMATH DE number 6881053 (Why is no real title available?)
- Edge proximity conditions for extendability in regular bipartite graphs
- scientific article; zbMATH DE number 1123785 (Why is no real title available?)
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)
