Jump to content

File:RecursiveEvenBipartite.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 306 × 144 pixels, file size: 5 KB)

Summary

Description
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
 
W3C-validity not checked.

Licensing

I, the copyright holder of this work, hereby publish it under the following licenses:
GNU head 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.
w:en:Creative Commons
attribution share alike
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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current10:11, 8 October 2009Thumbnail for version as of 10:11, 8 October 2009306 × 144 (5 KB)Renamed user KdYpUvMgTtext
02:01, 26 October 2007Thumbnail for version as of 02:01, 26 October 2007306 × 144 (22 KB)Melchoir{{Information |Description=Construction of a bipartition on a graph by parity of distance from a basepoint. |Source=self-made |Date=~~~~~ |Author= Melchoir }}

The following page uses this file:

Global file usage

The following other wikis use this file: