Browsing Bergen Open Research Archive by Author "Feghali, Carl"
Now showing items 1-2 of 2
-
Cyclability in Graph Classes
Crespelle, Christophe Dominique; Feghali, Carl; Golovach, Petr (Peer reviewed; Journal article, 2019)A subset T subseteq V(G) of vertices of a graph G is said to be cyclable if G has a cycle C containing every vertex of T, and for a positive integer k, a graph G is k-cyclable if every subset of vertices of G of size at ... -
Partitioning a graph into degenerate subgraphs
Abu-Khzam, Faisal; Feghali, Carl; Heggernes, Pinar (Journal article; Peer reviewed, 2020-01)Let G = (V, E) be a connected graph with maximum degree k ≥ 3 distinct from Kk+1. Given integers s ≥ 2 and p1, . . . , ps ≥ 0, G is said to be (p1, . . . , ps)-partitionable if there exists a partition of V into sets ...