The defective chromatic number of a graph class $\mathcal {G} $ is the minimum integer $ k
$ such that for some integer $ d $, every graph in $\mathcal {G} $ is $ k $-colourable such …

We give an algorithm that finds a zero forcing set which approximates the optimal size by a
factor of $\text {pw}(G)+ 1$, where $\text {pw}(G) $ is the pathwidth of $ G $. Starting from a …

The contraction $^* $-depth is the matroid depth parameter analogous to tree-depth of
graphs. We establish the matroid analogue of the classical graph theory result asserting that …

The circumference of a graph with at least one cycle is the length of a longest cycle in. A
classic result of Birmelé [J. Graph Theory, 43 (2003), pp. 24–25] states that the treewidth of is …

In 2019, Dvořák asked whether every connected graph GG has a tree decomposition (T, B)
(T,\mathcalB) so that TT is a subgraph of GG and the width of (T, B) (T,\mathcalB) is bounded …

Niezwykle ważnym tematem we współczesnej algorytmice jest badanie podstawowych
własności dynamicznie zmieniających się sieci, zwanych grafami dynamicznymi. W …