File:6n-graf.svg
From Wikipedia, the free encyclopedia
6n-graf.svg (SVG file, nominally 333 × 220 pixels, file size: 3 KB)
File history
Click on a date/time to view the file as it appeared at that time.
(latest | earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 17:02, 7 March 2007 | 333×220 (3 KB) | AzaToth | (oops, removed one too much) | |
| 17:01, 7 March 2007 | 333×220 (3 KB) | AzaToth | (removed unneeded attribs,) | ||
| 16:59, 7 March 2007 | 333×220 (3 KB) | AzaToth | (white fill) | ||
| 16:55, 7 March 2007 | 333×220 (3 KB) | AzaToth | (direct svg output from neato) | ||
| 03:04, 29 May 2006 | 360×240 (6 KB) | Booyabazooka | ({{Information | Description = Graph, created in Inkscape | Source = Image:6n-graf.png converted to SVG format | Date = May 28, 2006 | Author = en:User:Booyabazooka | Permission = The image is in the public domain. | other_versions = }} {) |
File links
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):
- Computer science
- Talk:Computer science
- Discrete mathematics
- Graph theory
- Mathematics
- Planar graph
- Shortest path problem
- Theoretical computer science
- Glossary of graph theory
- Graph (mathematics)
- Clique (graph theory)
- Graph (data structure)
- Navigational database
- Fork (topology)
- Vertex (graph theory)
- Laplacian matrix
- Graph property
- Dominating set problem
- Algebraic connectivity
- Template:Maths rating
- User:Paul August/Subpage 25
- Structural cohesion
- Neighbourhood (graph theory)
- Portal:Mathematics/Selected article/29
- Frequency partition
- Bivariegated graph
- Portal:Topology/Selected article
- Portal:Discrete mathematics/Selected article
- Portal:Discrete mathematics/Selected article/1
- Portal:Topology/Selected article/6
- Template:Maths rating/doc
- Template:WikiProject Mathematics/doc
- Template:Maths rating/sandbox
- Wikipedia:Reference desk/Archives/Mathematics/2009 February 19

