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. ISBN1-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.
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
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.