An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
We consider the mixed integer version of bipartite vertex cover. This is equivalent to the mixed integer network dual model, recently introduced in [2], that generalizes several m...
Michele Conforti, Laurence A. Wolsey, Giacomo Zamb...
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...