Matchings in graphs of odd regularity and girth
From MaRDI portal
Publication:394288
Recommendations
- Maximum matchings in regular graphs of high girth
- Tight lower bounds on the size of a maximum matching in a regular graph
- scientific article; zbMATH DE number 139932
- On the order of close to regular graphs without a matching of given size.
- Maximum matchings in a regular graph of specified connectivity and bounded order
Cites work
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Independent sets and matchings in subcubic graphs
- Matching and edge-connectivity in regular graphs
- Matching theory
- Matchings in regular graphs from eigenvalues
- Maximum matchings in regular graphs of high girth
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Tight bounds on maximal and maximum matchings
- Tight lower bounds on the size of a maximum matching in a regular graph
Cited in
(11)- A lower bound on the acyclic matching number of subcubic graphs
- Local boxicity
- scientific article; zbMATH DE number 139932 (Why is no real title available?)
- Odd subgraphs and matchings
- Lower bounds on the uniquely restricted matching number
- Results and open problems in matchings in regular graphs
- Regularity, matchings and Cameron-Walker graphs
- Matchings in 3-vertex-critical graphs: the odd case
- Uniquely restricted matchings in subcubic graphs without short cycles
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Maximum matchings in regular graphs of high girth
This page was built for publication: Matchings in graphs of odd regularity and girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394288)
