Three forbidden subgraphs for line graphs
暂无分享,去创建一个
We construct a set of three graphs with the property that a 3-connected graph with minimum degree at least 7 is a line graph if and only if it does not contain any of the three graphs as an induced subgraph. We also show that the number of excluded subgraphs cannot be reduced no matter what connectivity is specified.
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Lubomír Soltés. Forbidden induced subgraphs for line graphs , 1994, Discret. Math..