Decompositions of graphs with degree constraints relative to prescribed subgraphs

Peichao Wei, Muhuo Liu, Yang Wu +1

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a gr…