Bicolored matchings in some classes of graphs - LAMSADE (Laboratoire d'Analyse et de Modélisation des Systèmes pour l'Aide à la Décision) Accéder directement au contenu
Article Dans Une Revue AKCE International Journal of Graphs and Combinatorics Année : 2007

Bicolored matchings in some classes of graphs

Résumé

We consider the problem of finding in a graph a set R of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with n nodes on each side, we give sufficient conditions for the existence of a set R with |R|=n+1 such that perfect matchings with k red edges exist for all k,0?k?n. Given two integers p
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01125192 , version 1

Citer

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries. Bicolored matchings in some classes of graphs. AKCE International Journal of Graphs and Combinatorics, 2007, 23, pp.47-60. ⟨hal-01125192⟩
66 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More