Original file (SVG file, nominally 225 × 171 pixels, file size: 3 KB)
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | 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 |
The following other wikis use this file: