File:Chordal-graph.svg
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
![File:Chordal-graph.svg](https://upload.wikimedia.org/wikipedia/commons/thumb/3/34/Chordal-graph.svg/225px-Chordal-graph.svg.png?20060217174919)
Size of this PNG preview of this SVG file: 225 × 171 pixels. Other resolutions: 316 × 240 pixels | 632 × 480 pixels | 1,011 × 768 pixels | 1,280 × 973 pixels | 2,560 × 1,946 pixels.
Original file (SVG file, nominally 225 × 171 pixels, file size: 3 KB)
File information
Structured data
Captions
Captions
Add a one-line explanation of what this file represents
Summary
[edit]DescriptionChordal-graph.svg | 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. |
Date | 16 February 2006 (original upload date) |
Source | No machine-readable source provided. Own work assumed (based on copyright claims). |
Author | No machine-readable author provided. Tizio assumed (based on copyright claims). |
Licensing
[edit]Public domainPublic domainfalsefalse |
![]() |
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
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 (talk | contribs) | A chordal graph with a minimal number of chords |
18:00, 16 February 2006 | ![]() | 225 × 171 (4 KB) | Tizio (talk | contribs) | White background | |
17:49, 16 February 2006 | ![]() | 207 × 153 (3 KB) | Tizio (talk | contribs) | 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 |
You cannot overwrite this file.
File usage on Commons
The following page uses this file:
File usage on other wikis
The following other wikis use this file:
- Usage on bn.wikipedia.org
- Usage on en.wikipedia.org
- Usage on eo.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on fr.wikipedia.org
- Usage on hu.wikipedia.org
- Usage on it.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on ko.wikipedia.org
- Usage on nl.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
- Usage on www.wikidata.org
- Usage on zh.wikipedia.org