A construction of k-graceful graphs from complete bipartite graphs
For a special family of bipartite graphs M(m,n) built up of two copies of complete bipartite graphs \(K_{m,n}\) the problem of gracefulness is investigated and partial results are given.
scientific article; zbMATH DE number 4099378