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...
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...