53 citations · 86 across the 11 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2019
Strengthening some complexity results on toughness of graphs
Gyula Y Katona, Kitti Varga
Let be a positive real number. A graph is called -tough if the removal of any vertex set that disconnects the graph leaves at most components. The toughness of a…
cs.DM2018
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets
Mikio Kano, Kenta Noguchi, David Orden
Let and be a set of red points and a set of blue points in the plane, respectively, such that is in general position, and let be a fu…