Olga Fourtounelli

  • Citations Per Year
Learn More
All graphs considered are simple and finite. We refer the reader to [2] for standard graph theoretic terms not defined in this paper. Let G be a graph. For any subset X of vertices of G, we define the neighbourhood of X in G to be the set of all vertices adjacent to vertices in X; this set is denoted by NG(X). The subgraph of Gwhose vertex set is X and(More)
LetG be a simple connected graph such that δ(G) ≥ 3. For every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, the square graph G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [2] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G(More)
Let G be a 2-connected claw-free graph such that δ(G) ≥ 5. Then for every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [1] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G is the(More)
  • 1