1 citations · 1 across the 4 of their papers we have counts for
7 papers
The complexity of the Clar number problem and an FPT algorithm
Erika R. Bérczi-Kovács, Attila Bernáth
The Clar number of a (hydro)carbon molecule, introduced by Clar [E. Clar, \emph{The aromatic sextet}, (1972).], is the maximum number of mutually disjoint resonant hexagons in the…
Blocking optimal -arborescences
Attila Bernáth, Tamás Király
Given a digraph and a positive integer , an arc set is called a \textbf{-arborescence} if it is the disjoint union of spanning arborescences. The…
Blocking unions of arborescences
Attila Bernáth, Gyula Pap
Given a digraph and a positive integer , a subset is called a \textbf{-union-arborescence}, if it is the disjoint union of spanning arborescences…
Blocking optimal arborescences
Attila Bernáth, Gyula Pap
The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that th…
A note on -free -matchings
Kristóf Bérczi, Attila Bernáth, Máté Vizer
Motivated by a conjecture of Liang [Y.-C. Liang. {\em Anti-magic labeling of graphs}. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing pr…
Regular graphs are antimagic
Kristóf Bérczi, Attila Bernáth, Máté Vizer
An undirected simple graph is called antimagic if there exists an injective function such that $\sum_{e\in E(u)} f(e)\neq\sum_{e\in E(v)}…
On the tractability of some natural packing, covering and partitioning problems
Attila Bernáth, Zoltán Király
In this paper we fix 7 types of undirected graphs: paths, paths with prescribed endvertices, circuits, forests, spanning trees, (not necessarily spanning) trees and cuts. Given an…