scientific article
From MaRDI portal
Publication:2816516
zbMath1343.05085MaRDI QIDQ2816516
Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, J.-A. Anglès d'Auriac, Yannis Manoussakis
Publication date: 23 August 2016
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2765/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40)
Related Items (8)
Tropical matchings in vertex-colored graphs ⋮ Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size ⋮ Enumeration of minimal tropical connected sets ⋮ Some rainbow problems in graphs have complexity equivalent to satisfiability problems ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ Exact exponential algorithms to find tropical connected sets of minimum size ⋮ Maximum colorful independent sets in vertex-colored graphs
This page was built for publication:
