Matchings in graphs of odd regularity and girth
From MaRDI portal
Publication:394288
DOI10.1016/J.DISC.2013.08.030zbMath1281.05105OpenAlexW2153055165MaRDI QIDQ394288
Vitor Costa, Dieter Rautenbach, Simone Dantas
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.030
Related Items (4)
Local boxicity ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ Uniquely restricted matchings in subcubic graphs without short cycles ⋮ Lower bounds on the uniquely restricted matching number
Cites Work
- Independent sets and matchings in subcubic graphs
- Matching and edge-connectivity in regular graphs
- Maximum matchings in regular graphs of high girth
- Matchings in regular graphs from eigenvalues
- Matching theory
- Tight bounds on maximal and maximum matchings
- Tight lower bounds on the size of a maximum matching in a regular graph
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
This page was built for publication: Matchings in graphs of odd regularity and girth