\(H\)-free coloring on graphs with bounded tree-width

DOI10.1007/978-3-030-11509-8_19OpenAlexW2909363799MaRDI QIDQ2326574

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

Publication date: 10 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-11509-8_19

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Vertex partitioning problems on graphs with bounded tree width

This page was built for publication: \(H\)-free coloring on graphs with bounded tree-width