Vertex partitioning problems on graphs with bounded tree width

DOI10.1016/j.dam.2021.05.016zbMath1494.05090MaRDI QIDQ2161252

Anjeneya Swami Kare, N. R. Aravind, Subrahmanyam Kalyanasundaram

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.016

zbMATH Keywords

parameterized algorithm; decomposable graphs; matching cut; H-free coloring

Mathematics Subject Classification ID

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

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)