Peter Whalen

most citedA new bound for the 2/3 conjecture

3 citations · 3 across the 1 of their papers we have counts for

collaborators

3 papers

math.CO2013

Odd K_3,3 subdivisions in bipartite graphs

Robin Thomas, Peter Whalen

We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally dis…

math.CO2013

Deploying robots with two sensors in $K_{1, 6}$ -free graphs

Waseem Abbas, Magnus Egerstedt, Chun-Hung Liu +2

Let $G$ be a graph of minimum degree at least two with no induced subgraph isomorphic to $K_{1, 6}$ . We prove that if $G$ is not isomorphic to one of eight exceptional graphs, then…

cs.DM2012★ 3 cited

A new bound for the 2/3 conjecture

Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni +2

We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one…

Odd K_3,3 subdivisions in bipartite graphs

Deploying robots with two sensors in K1,6​-free graphs

A new bound for the 2/3 conjecture

Deploying robots with two sensors in $K_{1, 6}$ -free graphs