• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Bicolored matchings in some classes of graphs

Thumbnail
Date
2004
Dewey
Principes généraux des mathématiques
Sujet
Matchings; Alternating cycles; Bicolored graphs; Cacti; bipartite graphs; Line-perfect graphs; trees
Journal issue
AKCE International Journal of Graphs and Combinatorics
Volume
23
Publication date
02-2007
Article pages
47–60
DOI
http://dx.doi.org/10.1007/s00373-006-0686-8
URI
https://basepub.dauphine.fr/handle/123456789/20770
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Costa, Marie-Christine
de Werra, Dominique
Picouleau, Christophe
Ries, Bernard
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Article accepté pour publication ou publié
Abstract (EN)
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

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.