Skip to Main content Skip to Navigation
Journal articles

Connected Tropical Subgraphs in Vertex-Colored Graphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 17, 2016 - 11:36:03 AM
Last modification on : Monday, July 4, 2022 - 9:39:39 AM
Long-term archiving on: : Friday, November 18, 2016 - 10:06:53 AM


Explicit agreement for this submission



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, DMTCS, 2016, Vol. 17 no. 3 (3), pp.327-348. ⟨10.46298/dmtcs.2151⟩. ⟨hal-01352845⟩



Record views


Files downloads