Tropical matchings in vertex-colored graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2017

Tropical matchings in vertex-colored graphs

H.P. Phong
  • Fonction : Auteur
Zs. Tuza
  • Fonction : Auteur
Yannis Manoussakis

Résumé

A subgraph of a vertex-colored graph is said to be tropical whenever it contains all colors of the original graph. In this work we study the problem of finding, if any, maximum tropical matchings in vertex-colored graphs. We show that this problem is polynomial. We also provide a polynomial algorithm of time for finding, if any, a minimum tropical matching in vertex-colored graphs.

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-01635411 , version 1 (15-11-2017)

Identifiants

Citer

Johanne Cohen, H.P. Phong, Zs. Tuza, Yannis Manoussakis. Tropical matchings in vertex-colored graphs. Electronic Notes in Discrete Mathematics, 2017, 62, pp.219 - 224. ⟨10.1016/j.endm.2017.10.038⟩. ⟨hal-01635411⟩
192 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More