Olga Fourtounelli

Learn More
Let G 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 2 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 d G (u) of a vertex u(More)
  • 1