论文信息 - Induced matchings in cubic graphs

Induced matchings in cubic graphs

In this paper, we show that the edge set of a cubic graph can always be partitioned into 10 subsets, each of which induces a matching in the graph. This result is a special case of a general conjecture made by Erdos and NeSetiil: For each d 2 3, the edge set of a graph of maximum degree d can always be partitioned into [5d2/4] subsets each of which induces a matching. 0 1993 John Wiley & Sons, Inc.

[1] Lars Døvling Anderson. The strong chromatic index of a cubic graph is at most 10 , 1992 .

[2] Paul Erdös,et al. Problems and results in combinatorial analysis and graph theory , 1988, Discret. Math..

[3] Zsolt Tuza,et al. Induced matchings in bipartite graphs , 1989, Discret. Math..

[4] Zsolt Tuza,et al. The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..

[5] P. Hall. On Representatives of Subsets , 1935 .

[6] Angelika Steger,et al. On induced matchings , 1993, Discret. Math..

[7] R. Schelp,et al. THE STRONG CHROMATIC INDEX OF GRAPHS , 1990 .