scientific article; zbMATH DE number 6857799
From MaRDI portal
Publication:4634386
DOI10.4230/LIPIcs.IPEC.2016.3zbMath1398.05191MaRDI QIDQ4634386
Dániel Marx, Zsolt Tuza, Gábor Bacsó
Publication date: 10 April 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ Unnamed Item ⋮ Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs ⋮ \(H\)-colouring \(P_t\)-free graphs in subexponential time ⋮ Mim-width. III. Graph powers and generalized distance domination problems ⋮ Vertex cover at distance on \(H\)-free graphs
This page was built for publication:
