Sparsity pp 339-361 | Cite as

Some Applications

  • Jaroslav Nešetřil
  • Patrice Ossona de Mendez
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 28)

Abstract

A matching of a graph G is a set of pairwise non-intersecting edges. An induced matching of a graph G is a matching of G which is an induced subgraph of G, that is a matching with the property that no endpoint of an edge in the matching is adjacent to an endpoint of another edge in the matching.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jaroslav Nešetřil
    • 1
  • Patrice Ossona de Mendez
    • 2
  1. 1.Computer Science Institute of Charles University (IUUK) Department of Applied MathematicsCharles UniversityPragueCzech Republic
  2. 2.Mathématique Sociales (UMR 8557)CNRS Centre d’Analyse et deParisFrance

Personalised recommendations