scientific article; zbMATH DE number 7058465

zbMath1411.05214arXiv1810.08276MaRDI QIDQ5377222

Eurinardo R. Costa, Uéverton S. Souza, Rafael T. Araújo, Sulamita Klein, Rudini Menezes Sampaio

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1810.08276

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fixed parameter tractabilitydegenerate graphspolynomial kernelprimeval decompositionwell covered graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity ⋮ Recognizing well-dominated graphs is coNP-complete ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ On the probe problem for \((r,\ell )\)-well-coveredness ⋮ Partitions and well-coveredness: the graph sandwich problem

This page was built for publication: