Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
Let G be a directed graph with n vertices and non-negative weights in its directed edges, embedded on a surface of genus g, and let f be an arbitrary face of G. We describe an alg...
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...