|
 
|
[CDP07] Bicolored matchings in some classes of graphs
Revue Internationale avec comité de lecture : Journal Graphs and Combinatorics, vol. 23, pp. 47-60, 2007, (doi:10.1007/s00373-006-0686-8)
motcle:
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
Equipe:
oc
Collaboration:
LAMSADE
BibTeX
| @article { | |||
| CDP07, | |||
| title | = | "{Bicolored matchings in some classes of graphs}", | |
| author | = | "M.-C. Costa and D. de Werra and C. Picouleau and B. Ries", | |
| journal | = | "Graphs and Combinatorics", | |
| year | = | 2007, | |
| volume | = | 23, | |
| pages | = | "47-60", | |
| doi | = | "10.1007/s00373-006-0686-8", | |
| } | |||
