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.
In case this is not legally possible: David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
In case this is not legally possible: Braindrain0000 grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
2007-01-20 07:09 Braindrain0000 1172×1132×0 (36496 bytes) Reverted to earlier revision
2007-01-20 04:47 David Eppstein 256×256×0 (7848 bytes) 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]].
2007-01-20 04:19 Braindrain0000 1172×1132×0 (36496 bytes) Created using Inkscape based on [[:Image:Forbidden-line-subgraphs.png]]
PNG version:
2006-11-03 05:49 David Eppstein 702×567×8 (15169 bytes) Nine minimal graphs that are not [[line graph]]s, 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]].
Captions
Add a one-line explanation of what this file represents
Items portrayed in this file
depicts
copyright status
copyrighted, dedicated to the public domain by copyright holder
copyright license
released into the public domain by the copyright holder
inception
20 January 2007
File history
Click on a date/time to view the file as it appeared at that time.
{{Information |Description=Nine minimal graphs that are not en: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 en:induced subgraph. |Source=Originally
You must be logged in to post a comment.