Image:Forbidden-line-subgraphs.png

From Wikipedia, the free encyclopedia

[edit] Summary

Nine minimal graphs that are not line graphs, as identified by Beineke (1968, 1970). A graph is a line graph if and only if it does not contain one of these nine graphs as an induced subgraph.

[edit] Licensing

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current05:49, 3 November 2006702×567 (15 KB)David Eppstein (Talk | contribs) (Nine minimal graphs that are not line graphs, as identified by Beineke (1968, 1970). A graph is a line graph if and only if it does not contain one of these nine graphs as an induced subgraph.)

No pages on the English Wikipedia link to this file. (Pages on other projects are not counted.)