File:Forbidden line subgraphs.svg
跳转到导航
跳转到搜索
此SVG文件的PNG预览的大小：682 × 549像素。 其他分辨率：298 × 240像素 | 596 × 480像素 | 954 × 768像素 | 1,272 × 1,024像素 | 2,544 × 2,048像素。
原始文件 （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释出到公有领域。这适用于全世界。 如果这样做不合法的话： |
|
|
本作品已被作者中文維基百科项目的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日 (四) 06:03 | | 682 × 549（18 KB） | wikimediacommons>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 |
文件用途
以下页面使用本文件：
