Induced matchings in subcubic planar graphs

Authors:
Ross J. Kang;Matthias Mnich;Tobias Müller
Affiliations:
Durham University, Durham, United Kingdom;Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
Venue:
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Year:
2010

Citing 9
Cited 2

Induced matchings in bipartite graphs

Discrete Mathematics - In memory of Tory Parsons
The maximum number of edges in 2K2-free graphs of bounded degree

Discrete Mathematics
The strong chromatic index of a cubic graph is at most 10

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Induced matchings in cubic graphs

Journal of Graph Theory
Algorithms and Data Structures: The Basic Toolbox

Algorithms and Data Structures: The Basic Toolbox
The parameterized complexity of the induced matching problem

Discrete Applied Mathematics
Parameterized complexity of finding regular induced subgraphs

Journal of Discrete Algorithms
Improved Induced Matchings in Sparse Graphs

Parameterized and Exact Computation
The distance-2 matching problem and its relationship to the MAC-Layer capacity of ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

New results on maximum induced matchings in bipartite graphs and beyond

Theoretical Computer Science
Maximum matching in multi-interface networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a linear-time algorithm that, given a planar graph with m edges and maximum degree 3, finds an induced matching of size at least m/9. This is best possible.