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.
Au cas où cela n'est pas possible légalement : David Eppstein donne à toute personne le droit d'utiliser ce document dans n'importe quel but, sans aucune condition, à moins que de telles conditions soient imposées par la loi.
Au cas où cela n'est pas possible légalement : Braindrain0000 donne à toute personne le droit d'utiliser ce document dans n'importe quel but, sans aucune condition, à moins que de telles conditions soient imposées par la loi.
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]].
Légendes
Ajoutez en une ligne la description de ce que représente ce fichier
{{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