Research problems (Q5903745)

B. Alspach and H. Oral pose problem 95. They define \(\alpha (A)=\min \{| E(H)| -| V(H)| +1:\quad H\in C(A)\},\) where A is an independent set of vertices in a graph G, and C(A) denotes the collection of all connected induced subgraphs of G which contain A. \(\omega\) (A) is to be investigated for different A's. D. de Caen poses problem 96. A facial factor of a graph G, which is embedded in the plane, is a 2-factor each of whose components is the boundary of some face of G. Necessary and sufficient conditions for the existence of a facial factor in a plane graph G are being asked for.