Partitions of Graphs into Special Bipartite Graphs
Partitions of Graphs into Special Bipartite Graphs
We study the problem of partitioning the edge set of a graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to both classical, such as partitioning into independent matchings and complete bipartite subgraphs, and novel partitioning problems. The theoretical framework we provide is motivated by …