跳至內容

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:03於 2007年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 使用了這個檔案: