Minimum size extensible graphs for (near) perfect matchings - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Minimum size extensible graphs for (near) perfect matchings

Résumé

We define as extensible a graph G such that for every pair u,v of non adjacent vertices it is possible to extend the non-edge uv to a perfect (or near perfect) matching using only edges of G that are not incident to u or v. For every order n of G we give Ext(n) the minimum size of an extensible graph.
Fichier non déposé

Dates et versions

hal-01126404 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01126404 , version 1

Citer

Christophe Picouleau, Dominique de Werra, Marie-Christine Costa. Minimum size extensible graphs for (near) perfect matchings. International Conference on Graph Theory, Apr 2014, Grenoble, France. pp.juin 2014. ⟨hal-01126404⟩
62 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More