C. Zamfirescu

activity

20132026

most citedImproved bounds for hypohamiltonian graphs

17 citations · 56 across the 23 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Spanning trees for many different numbers of leaves

Kenta Noguchi, Carol T. Zamfirescu

Let $G$ be a connected graph and $L (G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$ , the set…

math.CO2023

Generation and New Infinite Families of $K_{2}$ -hypohamiltonian Graphs

Jan Goedgebeur, Jarne Renders, Carol T. Zamfirescu

We present an algorithm which can generate all pairwise non-isomorphic $K_{2}$ -hypohamiltonian graphs, i.e. non-hamiltonian graphs in which the removal of any pair of adjacent vertic…

math.CO2023★ 5 cited

$K_{2}$ -Hamiltonian Graphs: II

Jan Goedgebeur, Jarne Renders, Gábor Wiener +1

In this paper we use theoretical and computational tools to continue our investigation of $K_{2}$ -hamiltonian graphs, that is, graphs in which the removal of any pair of adjacent ver…

Spanning trees for many different numbers of leaves

Generation and New Infinite Families of K2​-hypohamiltonian Graphs

K2​-Hamiltonian Graphs: II

Generation and New Infinite Families of $K_{2}$ -hypohamiltonian Graphs

$K_{2}$ -Hamiltonian Graphs: II