File:RecursiveEvenBipartite.svg
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
![File:RecursiveEvenBipartite.svg](https://upload.wikimedia.org/wikipedia/commons/thumb/b/b9/RecursiveEvenBipartite.svg/306px-RecursiveEvenBipartite.svg.png?20091008101134)
Size of this PNG preview of this SVG file: 306 × 144 pixels. Other resolutions: 320 × 151 pixels | 640 × 301 pixels | 1,024 × 482 pixels | 1,280 × 602 pixels | 2,560 × 1,205 pixels.
Original file (SVG file, nominally 306 × 144 pixels, file size: 5 KB)
File information
Structured data
Captions
Captions
Add a one-line explanation of what this file represents
Summary
[edit]DescriptionRecursiveEvenBipartite.svg |
English: Construction of a bipartition on a graph by parity of distance from a basepoint. |
Date | (UTC) |
Source | Own work The construction is described in the proof Theorem 3.5, "A connected graph is bipartite if and only if it contains no cycle of odd length.", on pages 53-54 of Anderson, Ian (2001). A First Course in Discrete Mathematics. London: Springer. p. 53. ISBN 1-85233-236-0. Figure 3.9 on page 53 depicts some bipartite graphs. This image, RecursiveEvenBipartite.svg, differs from Anderson in that it uses a different graph, it uses colors instead of the letters B/W, and it labels the vertices by distance as in the algorithm. |
Author | Melchoir |
Licensing
[edit]I, the copyright holder of this work, hereby publish it under the following licenses:
![]() |
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue |
![w:en:Creative Commons](https://upload.wikimedia.org/wikipedia/commons/thumb/7/79/CC_some_rights_reserved.svg/90px-CC_some_rights_reserved.svg.png)
![attribution](https://upload.wikimedia.org/wikipedia/commons/thumb/1/11/Cc-by_new_white.svg/24px-Cc-by_new_white.svg.png)
![share alike](https://upload.wikimedia.org/wikipedia/commons/thumb/d/df/Cc-sa_white.svg/24px-Cc-sa_white.svg.png)
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported, 2.5 Generic, 2.0 Generic and 1.0 Generic license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
You may select the license of your choice.
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 10:11, 8 October 2009 | ![]() | 306 × 144 (5 KB) | Renamed user KdYpUvMgT (talk | contribs) | text |
02:01, 26 October 2007 | ![]() | 306 × 144 (22 KB) | Melchoir (talk | contribs) | {{Information |Description=Construction of a bipartition on a graph by parity of distance from a basepoint. |Source=self-made |Date=~~~~~ |Author= Melchoir }} |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on ca.wikipedia.org
- Usage on el.wikipedia.org
- Usage on en.wikipedia.org
- Usage on hu.wikipedia.org
- Usage on id.wikipedia.org
- Usage on it.wikipedia.org
- Usage on ja.wikipedia.org
- Usage on pl.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on si.wikipedia.org
- Usage on sl.wikipedia.org
- Usage on th.wikipedia.org
- Usage on vi.wikipedia.org