E. Grimm

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2022

Existence of $2$ -Factors in Tough Graphs without Forbidden Subgraphs

Elizabeth Grimm, Songling Shan, Anna Johnsen

For a given graph $R$ , a graph $G$ is $R$ -free if $G$ does not contain $R$ as an induced subgraph. It is known that every $2$ -tough graph with at least three vertices has a $2$ -fac…

math.CO2021

Hamiltonicity of 3-tough $(K_{2} \cup 3 K_{1})$ -free graphs

Andrew Hatfield, Elizabeth Grimm

Chvátal conjectured in 1973 the existence of some constant $t$ such that all $t$ -tough graphs with at least three vertices are hamiltonian. While the conjecture has been proven for…

Existence of 2-Factors in Tough Graphs without Forbidden Subgraphs

Hamiltonicity of 3-tough (K2​∪3K1​)-free graphs

Existence of $2$ -Factors in Tough Graphs without Forbidden Subgraphs

Hamiltonicity of 3-tough $(K_{2} \cup 3 K_{1})$ -free graphs