scientific article; zbMATH DE number 6987353

zbMath1400.05105arXiv1512.05223MaRDI QIDQ4558957

Sulamita Klein, Rubens Sucupira, Ignasi Sau, Luérbio Faria

Publication date: 30 November 2018

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

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

zbMATH Keywords

split graphsparameterized complexitypolynomial kernelsmax cut\((r,\ell)\)-graphsparameterization above lower bound

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

On the complexity of coloring ‐graphs ⋮ Partitions and well-coveredness: the graph sandwich problem

This page was built for publication: