Partitioning H-Free Graphs of Bounded Diameter
From MaRDI portal
Publication:6367297
DOI10.1016/J.TCS.2022.07.009arXiv2105.04588MaRDI QIDQ6367297
Barnaby Martin, Siani Smith, Daniël Paulusma, Christoph Brause, Petr A. Golovach
Publication date: 10 May 2021
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Partitioning H-Free Graphs of Bounded Diameter