Induced matchings in graphs of degree at most 4
Abstract
We show that if G is a connected graph of maximum degree at most 4, which is not C2,5, then the strong matching number of G is at least 19n(G). This bound is tight and the proof implies a polynomial time algorithm to find an induced matching of this size.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.