1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
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…
cs.DM2015
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)}…