Showing cs.DMShow all
2 papers · 1 filter
cs.DM2025
How to see the forest despite the trees
Erika Bérczi-Kovács, András Frank
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of disjoint spanning trees of a graph, along with its count…
cs.DM2015
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…