On Decompositions of the Johnson Graph
摘要
Most of the results on graph decompositions involve a partition of the edges of the complete graph, complete bipartite graph, or complete multipartite graph into disjoint copies of one or more small graphs. In this chapter we find conditions for the decompositions of the Johnson graph into a variety of smaller subgraphs including cycles, path, and other common subgraphs.