Connected Tropical Subgraphs in Vertex-Colored Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2016

Connected Tropical Subgraphs in Vertex-Colored Graphs

Résumé

A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color of the graph. In this work we study the problem of finding a minimal connected tropical subgraph. We first show that this problem is NP-Hard for trees, interval graphs and split graphs, but polynomial when the number of colors is logarithmic in terms of the order of the graph (i.e. FPT). We then provide upper bounds for the order of the minimal connected tropical subgraph under various conditions. We finally study the problem of finding a connected tropical subgraph in a randomly vertex-colored random graph.
Fichier principal
Vignette du fichier
2765-9988-2-PB.pdf (310.1 Ko) Télécharger le fichier
Origine : Accord explicite pour ce dépôt
Loading...

Dates et versions

hal-01352845 , version 1 (17-08-2016)

Identifiants

Citer

Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, et al.. Connected Tropical Subgraphs in Vertex-Colored Graphs. Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.327-348. ⟨10.46298/dmtcs.2151⟩. ⟨hal-01352845⟩
313 Consultations
1248 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More