G. Bacsó

activity

20132023

most citedSubexponential-time Algorithms for Maximum Independent Set in

P_{t}

-free and Broom-free Graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2023

The robust chromatic number of graphs

Gábor Bacsó, Balázs Patkós, Zsolt Tuza +1

A 1-removed subgraph $G_{f}$ of a graph $G = (V, E)$ is obtained by $(i)$ selecting at most one edge $f (v)$ for each vertex $v \in V$ , such that $v \in f (v) \in E$ (the mapping $f:V\to E \…

cs.DS2018★ 2 cited

Subexponential-time Algorithms for Maximum Independent Set in $P_{t}$ -free and Broom-free Graphs

Gábor Bacsó, Daniel Lokshtanov, Dániel Marx +3

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on $P_{t}$ -free graphs, that is, on graphs not containing a…

cs.DM2013

Minimum order of graphs with given coloring parameters

Gabor Bacso, Piotr Borowiecki, Mihaly Hujter +1

A complete $k$ -coloring of a graph $G = (V, E)$ is an assignment $φ : V \to {1, \dots, k}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the uni…

The robust chromatic number of graphs

Subexponential-time Algorithms for Maximum Independent Set in Pt​-free and Broom-free Graphs

Minimum order of graphs with given coloring parameters

Subexponential-time Algorithms for Maximum Independent Set in $P_{t}$ -free and Broom-free Graphs