16 citations · 48 across the 24 of their papers we have counts for
Showing 2023 · math.COShow all
2 papers · 2 filters
math.CO2023★ 1 cited
Infinite families of -vertex-critical (, )-free graphs
Ben Cameron, Chính T. Hoàng
A graph is -vertex-critical if but for all . We construct a new infinite families of -vertex-critical -free graphs for all .…
math.CO2023★ 1 cited
A Closure Lemma for tough graphs and Hamiltonian degree conditions
Chinh T. Hoang, Cleophee Robin
The closure of a graph is the graph obtained from by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least , where is the…