Minimum size extensible graphs for (near) perfect matchings
april, 2014
Type de publication :
Conférence internationale avec actes
Conférence :
International Conference on Graph Theory, Grenoble, France
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.
BibTeX :
@inproceedings{Pic-DeW-Cos-2014,
author={Christophe Picouleau and Dominique de Werra and
Marie-Christine Costa },
title={Minimum size extensible graphs for (near) perfect matchings },
organization={International Conference on Graph Theory, Grenoble, France },
year={2014 },
month={4},
}