Image:Chordal-graph.svg
From Wikipedia, the free encyclopedia
Chordal-graph.svg (SVG file, nominally 225 × 171 pixels, file size: 3 KB)
| This is a file from the Wikimedia Commons. The description on its description page there is shown below.
|
[edit] Summary
A cycle (black) with two chords (green). As for this part, the graph is chordal. Note that both chords are necessary: if one is removed, the other green edge with three black edges would form a cycle of four edges with no chord.
[edit] Licensing
 |
I, the copyright holder of this work, hereby release it into the public domain. This applies worldwide. In case this is not legally possible: Afrikaans | Alemannisch | Aragonés | العربية | Asturianu | Български | Català | Česky | Cymraeg | Dansk | Deutsch | Eʋegbe | Ελληνικά | English | Español | Esperanto | Euskara | Estremeñu | فارسی | Français | Galego | 한국어 | हिन्दी | Hrvatski | Ido | Bahasa Indonesia | Íslenska | Italiano | עברית | Kurdî / كوردی | Latina | Lietuvių | Latviešu | Magyar | Македонски | Bahasa Melayu | Nederlands | Norsk (bokmål) | Norsk (nynorsk) | 日本語 | Polski | Português | Ripoarisch | Română | Русский | Shqip | Slovenčina | Slovenščina | Српски / Srpski | Svenska | ไทย | Tagalog | Türkçe | Українська | Tiếng Việt | Walon | 中文(简体) | 中文(繁體) | zh-yue-hant | +/- |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 17:49, 17 February 2006 | 225×171 (3 KB) | Tizio | (A chordal graph with a minimal number of chords) |
| 18:00, 16 February 2006 | 225×171 (4 KB) | Tizio | (White background) | |
| 17:49, 16 February 2006 | 207×153 (3 KB) | Tizio | (An example of a chordal graph: every pair of vertices in a cycle are connected by an egde. If the two vertices are not adjacent in the cycle, that edge is called a chord. Category:Graph theory) |
