Uniquely restricted matchings in subcubic graphs without short cycles
From MaRDI portal
Publication:6055410
DOI10.1002/jgt.22632zbMath1521.05158arXiv1810.04473OpenAlexW3094096913MaRDI QIDQ6055410
Maximilian Fürst, Dieter Rautenbach
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.04473
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Induced matchings in subcubic graphs without short cycles
- Matchings in graphs of odd regularity and girth
- Maximum matchings in regular graphs of high girth
- Matching theory
- Lower bounds on the uniquely restricted matching number
- Uniquely restricted matchings in subcubic graphs
- Independence, odd girth, and average degree
- Some Ramsey-Type Numbers and the Independence Ratio
- Tight lower bounds on the matching number in a graph with given maximum degree
- A new proof of the independence ratio of triangle-free cubic graphs
- Uniquely restricted matchings
This page was built for publication: Uniquely restricted matchings in subcubic graphs without short cycles