Induced Matchings in Subcubic Graphs
Combinatorics
2013-12-05 v1
Abstract
We prove that a cubic graph with edges has an induced matching with at least edges. Our result generalizes a result for planar graphs due to Kang, Mnich, and M\"{u}ller (Induced matchings in subcubic planar graphs, SIAM J. Discrete Math. 26 (2012) 1383-1411) and solves a conjecture of Henning and Rautenbach (Induced matchings in subcubic graphs without short cycles, to appear in Discrete Math.).
Keywords
Cite
@article{arxiv.1312.1110,
title = {Induced Matchings in Subcubic Graphs},
author = {Felix Joos and Dieter Rautenbach and Thomas Sasse},
journal= {arXiv preprint arXiv:1312.1110},
year = {2013}
}
Comments
8 pages