<?xml version="1.0" encoding="UTF-8"?><!-- generator="WordPress/2.8.5" -->
<rss version="0.92">
<channel>
	<title>Graph Theory</title>
	<link>http://blogs.springer.com/bondyandmurty</link>
	<description>The blog of the book by J.A. Bondy and U.S.R. Murty</description>
	<lastBuildDate>Fri, 09 Oct 2009 21:36:27 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	
	<item>
		<title>ex 1.5.12 (a) (first edition), ex 1.5.11 (a) (second printing)</title>
		<description>I think that we should require that the graph has no isolated vertices, because then if it is arc-transitive it has to be both vertex and edge transitive. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=418</link>
			</item>
	<item>
		<title>Open problem 70</title>
		<description>I would like background information concerning open problem 70. I cannot find the reference S. Thomassé 2005, nor can I find any mention of the conjecture in Sullivan 2006. Thanks. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=414</link>
			</item>
	<item>
		<title>Ex 10.3.6 (c)</title>
		<description>I am still battling with this part. Please check the details written in the text: the Turan graph (2,12) is actually the complete bipartite graph K(6,6), while the icosahedron is not bipartite. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=397</link>
			</item>
	<item>
		<title>page 317 (first edition), page 321 (second printing)</title>
		<description>The last sentence of the first paragraph is missing a full stop. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=393</link>
			</item>
	<item>
		<title>Exercise 1.4.6a</title>
		<description>Contributed by Jeannette Dooley.

The graph H should be formed by joining the first and fourth (not first and third) vertices of P. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=398</link>
			</item>
	<item>
		<title>Hint to ex 4.2.5 (b)</title>
		<description>I think that the equation that appears in the hint to ex 4.2.5 (b) is wrong, because w4=45, w3=16, f4=8, f3=3. Please check. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=380</link>
			</item>
	<item>
		<title>Hint to ex 4.1.15</title>
		<description>I suggest to use induction on n, but instead of deleting the root, delete a leaf at maximum distance from x, and such that its predecessor has minimal degree. Please let me know if that could work out. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=379</link>
			</item>
	<item>
		<title>Proof of Theorem 10.26 (clarification).</title>
		<description>Contributed by Yaad Blum.

In Case 2, one cannot apply Exercise 9.2.3 directly, as the union of B and C might be separable. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=376</link>
			</item>
	<item>
		<title>Proof of Lemma 10.33</title>
		<description>Contributed by Yaad Blum.

The term G+e should be replaced by H+e (twice). </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=369</link>
			</item>
	<item>
		<title>Exercise 14.2.9</title>
		<description>Contributed by Yaad Blum.

It must be assumed here that k is at least three. The Hajos join of two 2-critical graphs is not 2-critical. </description>
		<link>http://blogs.springer.com/bondyandmurty/?p=365</link>
			</item>
</channel>
</rss>
