Connected Tropical Subgraphs in Vertex-Colored Graphs

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 th...

Full description

Bibliographic Details

Published in:	Discrete Mathematics & Theoretical Computer Science
Main Authors:	Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2016-08-01
Subjects:	vertex-colored random graph vertex-colored graph connected subgraph tropical subgraph colorful subgraph [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/2151/pdf