The existence of k-factors in squares of graphs


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)
DOI: 10.1016/j.disc.2010.07.024