跳转到内容

File:Forbidden line subgraphs.svg

页面内容不支持其他语言。
這個文件來自維基共享資源
维基百科,自由的百科全书

原始文件(SVG文件,尺寸为682 × 549像素,文件大小:18 KB)


摘要

描述 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年1月20日 (原始上传日期)
来源 Originally from en.wikipedia; description page is/was here.
作者 Originally uploaded as a png image by David Eppstein at en.wikipedia. Redrawn as svg by Braindrain0000 at en.wikipedia
授权
(二次使用本文件)
Released into the public domain (by both authors).

许可协议

本作品已被作者中文维基百科项目的David Eppstein释出到公有领域。这适用于全世界。

如果这样做不合法的话:
David Eppstein无条件地授予任何人以任何目的使用本作品的权利,除非这些条件是法律规定所必需的。

本作品已被作者中文维基百科项目的Braindrain0000释出到公有领域。这适用于全世界。

如果这样做不合法的话:
Braindrain0000无条件地授予任何人以任何目的使用本作品的权利,除非这些条件是法律规定所必需的。

Original upload logs

(All user names refer to en.wikipedia)

SVG version:

  • 2007-01-20 12:01 Braindrain0000 682×549×0 (18562 bytes)
  • 2007-01-20 07:15 Braindrain0000 592×572×0 (28369 bytes)
  • 2007-01-20 07:11 Braindrain0000 1172×1122×0 (36986 bytes)
  • 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]].

说明

添加一行文字以描述该文件所表现的内容

此文件中描述的项目

描繪內容

文件历史

点击某个日期/时间查看对应时刻的文件。

日期/时间缩⁠略⁠图大小用户备注
当前2007年8月2日 (四) 05:032007年8月2日 (四) 05:03版本的缩略图682 × 549(18 KB)David Eppstein{{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

以下页面使用本文件:

全域文件用途

以下其他wiki使用此文件: