Partitioning graphs of bounded tree-width
From MaRDI portal
Publication:1307308
DOI10.1007/s004930050001zbMath0924.05022OpenAlexW1988191667MaRDI QIDQ1307308
Bogdan Oporowski, Guoli Ding, Dirk Vertigan, Daniel P. Sanders
Publication date: 31 October 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930050001
Related Items
Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph, Minimal reducible bounds for induced-hereditary properties, Induced and weak induced arboricities, On invariants of hereditary graph properties, Three ways to cover a graph, Edge-intersection graphs of grid paths: the bend-number, Paths between colourings of graphs with bounded tree-width, On the bend-number of planar and outerplanar graphs, \(\mathcal Q\)-Ramsey classes of graphs, On vertex partitions and some minor-monotone graph parameters, Excluding any graph as a minor allows a low tree-width 2-coloring, The Size Ramsey Number of Graphs with Bounded Treewidth