The Price of Connectivity for Vertex Cover
From MaRDI portal
Publication:5413911
zbMath1288.05141arXiv1303.2478MaRDI QIDQ5413911
Oliver Schaudt, Samuel Fiorini, Eglantine Camby, Jean Cardinal
Publication date: 2 May 2014
Full work available at URL: https://arxiv.org/abs/1303.2478
Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (12)
Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity ⋮ The Price of Connectivity for Cycle Transversals ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ Connected power domination in graphs ⋮ On the price of independence for vertex cover, feedback vertex set and odd cycle transversal ⋮ Unnamed Item ⋮ Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs ⋮ The price of connectivity for feedback vertex set ⋮ Complexity and computation of connected zero forcing ⋮ Connected vertex cover for \((sP_1+P_5)\)-free graphs ⋮ On cycle transversals and their connected variants in the absence of a small linear forest ⋮ The price of connectivity for cycle transversals
This page was built for publication: The Price of Connectivity for Vertex Cover
