34 citations · 64 across the 22 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
A simple proof of Talbot's theorem for intersecting separated sets
Peter Borg, Carl Feghali
A subset of is -separated if, when the elements of are considered on a circle, between any two elements of there are at least elements…
math.CO2020
Reducing the maximum degree of a graph: comparisons of bounds
Peter Borg
Let be the smallest number of vertices that can be removed from a non-empty graph so that the resulting graph has a smaller maximum degree. Let be the sma…
math.CO2020★ 1 cited
Extensions of the Art Gallery Theorem
Peter Borg, Pawaton Kaemawichanurat
Several domination results have been obtained for maximal outerplanar graphs (mops). The classical domination problem is to minimize the size of a set of vertices of an -ver…