Induced matchings in graphs of degree at most 4

Viet Hang Nguyen

Induced matchings in graphs of degree at most 4

Discrete Mathematics 2014-07-30 v1 Combinatorics

Authors: Viet Hang Nguyen

Abstract

We show that if $G$ is a connected graph of maximum degree at most $4$ , which is not $C_{2,5}$ , then the strong matching number of $G$ is at least $\frac{1}{9}n(G)$ . This bound is tight and the proof implies a polynomial time algorithm to find an induced matching of this size.

Keywords

induced matching strong matching number graph theory maximum degree polynomial time algorithm connected graph

Cite

@article{arxiv.1407.7604,
  title  = {Induced matchings in graphs of degree at most 4},
  author = {Viet Hang Nguyen},
  journal= {arXiv preprint arXiv:1407.7604},
  year   = {2014}
}

Comments

14 pages, 12 figures

Related papers

View all related →