10 citations · 20 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 2 cited
Longer Cycles in Essentially 4-Connected Planar Graphs
Igor Fabrici, Jochen Harant, Samuel Mohr +1
A planar 3-connected graph is called \emph{essentially -connected} if, for every 3-separator , at least one of the two components of is an isolated vertex. Jackson…
math.CO2017★ 5 cited
On Selkow's Bound on the Independence Number of Graphs
Jochen Harant, Samuel Mohr
For a graph with vertex set and independence number , S. M. Selkow (Discrete Mathematics, 132(1994)363--365) established the famous lower bound $\sum\limits_{v\in…