Solutions Manual

For Graph Theory

Mohammadesmail Nikfar
 ) y
et
ci
So
al
ic
at
m
he
at
M
an
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D

Dedicated to the AMS (American Mathematical Society)

Because of my personal reasons
 y )
et
ci
So
Preface

al
ic
at
m
he
at
*** Experimental texts***
M
This book is a solutions manual to the following two books:
an
ic
er

R J.A. Bondy and U.S.R. Murty, Graph Theory, First edition, Springer, 2007.
m

Bondy, J. A.; Murty, U. S. R.

(A

Graph theory. (English) Zbl 1134.05001

Graduate Texts in Mathematics 244. Berlin: Springer (ISBN 978-1-84628-969-9/hbk). xii, 651
S

p. (2008).
M

This textbook started out as an attempt to update the authors? previous book [J. A. Bondy
eA

and U. S. R. Murty, Graph theory with applications, American Elsevier Publishing, New York
(1976)]. However the project rapidly expanded into a much more substantial rewrite, much
th

larger than the original. The topics covered include: basic material on graphs and digraphs,
basic material on cycles and trees: tree-search algorithms: network flows (max-flow min
to

cut, Menger etc.): algorithm complexity: more connectivity results for graphs: planar graphs
and the four-colour problem: Turan?s theorem, Ramsey?s theorem and the regularity lemma:
ed

probabilistic methods: vertex colourings and colourings of maps: matchings, edge-colourings

at

and Hamilton cycles, covering and packings in directed graphs, electrical flows and networks,
ic

and integer flows and coverings. Digraphs, algorithmic aspects (including complexity) and
ed

some applications are discussed in more detail than in some comparable graph theory texts:
the theory of graph minors, which the authors felt they could not do justice too in a book of
D

this length, is only touched upon, and algebraic graph theory, and automorphism groups, are
perhaps developed in their own right rather less than in some comparable texts. Most results
mentioned are proved. The authors explain that they have written a text which is designed to
be usable both for a basic graph theory course, based on the introductory sections of a few
chapters (some particular suggestions in this direction are made in the blog, see below) but
also to be usable as an introduction to research in graph theory, by including more advanced
topics in each chapter. There are a large number of exercises in the book, of varying degrees of
difficulty. The text contains drawings of many standard interesting graphs, which are listed
at the end. The authors have attempted to bring out various commonly used proof techniques
(e.g. double counting, Mobius inversion, Lovasz local lemma, etc.) at various points, either
as insets or subsections. There is a list of unsolved problems at the end, and an extensive and
4

up-to-date bibliography. A webpage for the book http://blogs.springer.com/bondyandmurty/

has a few minor errors (e.g. in the proof of Theorem 3.1) noted on it, and contains hints for
some exercises, some suggested courses for different classes of users of the books (mathematics
students, computer science students, operational research students, graduate courses), and
some links to relevant webpages.
Reviewer: David B. Penman (Colchester), Zentralblatt MATH
The primary aim of this book is to present a coherent introduction to graph theory, suitable
as a textbook for advanced undergraduate and beginning graduate students in mathematics
and computer science. It provides a systematic treatment of the theory of graphs without
sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described

)
and illustrated. The book also serves as an introduction to research in graph theory.

y
Graph theory is a flourishing discipline containing a body of beautiful and powerful theorems

et
of wide applicability. Its explosive growth in recent years is mainly due to its role as an essen-

ci
tial structure underpinning modern applied mathematics ? computer science, combinatorial

So
optimization, and operations research in particular ? but also to its increasing application in
the more applied sciences. The versatility of graphs makes them indispensable tools in the

al
design and analysis of communication networks, for instance. The primary aim of this book is

ic
to present a coherent introduction to the subject, suitable as a textbook for advanced under-

at
graduate and beginning graduate students in mathematics and computer science. It provides a

m
systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal.
Commonly used proof techniques are described and illustrated, and a wealth of exercises - of

he
varying levels of difficulty - are provided to help the reader master the techniques and reinforce

at
their grasp of the material. A second objective is to serve as an introduction to research in graph
M
theory. To this end, sections on more advanced topics are included, and a number of interesting
and challenging open problems are highlighted and discussed in some detail. Despite this more
an
advanced material, the book has been organized in such a way that an introductory course on
graph theory can be based on the first few sections of selected chapters.
ic

Alex Dainiak, loving math since 2000:), lecturer at Moscow Institute of Physics and Technol-
er

ogy: Any of these books would make a solid choice. I would recommend Diestel?s book if
m

you are going to carry out research in graph theory or pure mathematics in general. I would
(A

recommend Bondy &Murty if graph theory is not your main subject of study or if your research
will be of applied kind. Diestel?s book is shorter (sheer page count is 1,5 smaller than that of
S

B&M), but more information-dense (more demanding to the reader). Diestel?s book contains
M

more or less thorough [as suitable for a university textbook] coverage of some important
research topics of modern graph theory ? e.g. minors, tangles, infinite graphs. These topics,
eA

though, are of little use for applied researcher or practitioner, as far as my experience goes.
B&M book has a broader coverage and to my view makes more effort to connect graph theory
th

with other subjects. E.g. this book contains chapters on the mathematical theory of electrical
networks and basics of computation complexity.
to
ed
at

R G. Chartrand and Linda Lesniak, Graphs & Digraphs, Third edition, Chapman and Hall/CRC,
ic

1996.
ed

Chartrand, Gary; Lesniak, Linda; Zhang, Ping

Graphs & digraphs. 5th ed. (English) Zbl 1211.05001
D

Boca Raton, FL: CRC Press (ISBN 978-1-4398-2627-0/hbk). xii, 586 p. (2011).
This is the fifth edition of the well-known and popular graph theory text. As with the earlier
editions (see [M. Behzad, G. Chartrand and L. Lesniak-Foster, Graphs & digraphs. Boston,
Massachusetts: Prindle, Weber&Schmidt (1979; Zbl 0403.05027)]; G. Chartrand and L. Les-
niak, Graphs & digraphs. 2nd ed. Monterey, Calif.: Wadsworth&Brooks/Cole Advanced
Brooks&Software (1986; Zbl 0666.05001); 3rd ed. London: Chapman&Hall (1996; Zbl
0890.05001); 4th ed. Boca Raton, FL: Chapman&Hall/CRC (2005; Zbl 1057.05001)]), the
current text emphasizes clear exposition, well-written proofs, and many original and innova-
tion exercises – of varying difficulty and challenge. New to the fifth edition are (1) new or
expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero
flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings;
 5

(2) new examples, figures, and applications; (3) expanded historical discussions of well-known
mathematicians and problems; (4) more than 300 new exercises, with hints or solutions to
those of odd number; (5) reorganization of sections into subsections for ease of reading; and (6)
bolded definitions of terms, for ease of location. There are a bibliography of 249 items, with 7
supplemental references; separate indices for names and concepts; and an extensive index of
symbols. For more than 30 years, Graphs&Digraphs, in its various editions, has served as an
exemplary introduction to the increasingly fascinating and relevant mathematical discipline
of graph theory, for both advanced undergraduate and graduate students. It has also served
established graph theorists, combinatorialists, and other discrete mathematicians, as well as
computer scientists, chemists, and other practitioners, as a useful reference work. The fifth

)
edition continues and extends these fine traditions.

y
Reviewer: Arthur T. White (Kalamazoo), Zentralblatt MATH

et
Continuing to provide a carefully written, thorough introduction, Graphs and Digraphs, Fifth

ci
Edition expertly describes the concepts, theorems, history, and applications of graph theory.

So
Nearly 50 percent longer than its bestselling predecessor, this edition reorganizes the material
and presents many new topics.

al
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant

ic
examples, and numerous exercises to provide an essential understanding of the concepts,

at
theorems, history, and applications of graph theory. Fully updated and thoughtfully reorganized

m
to make reading and locating material easier for instructors and students, the Sixth Edition
of this bestselling, classroom-tested text: Adds more than 160 new exercises Presents many

he
new concepts, theorems, and examples Includes recent major contributions to long-standing

at
conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and
M
Alspach’s Conjecture on graph decompositions Supplies a proof of the perfect graph theorem
Features a revised chapter on the probabilistic method in graph theory with many results
an
integrated throughout the text At the end of the book are indices and lists of mathematicians’
names, terms, symbols, and useful references. There is also a section giving hints and solutions
ic

to all odd-numbered exercises. A complete solutions manual is available with qualifying course
er

adoption. Graphs & Digraphs remains the consummate text for an advanced undergraduate
m

level or introductory graduate level course or two-semester sequence on graph theory, exploring
(A

the subject’s fascinating history while covering a host of interesting problems and diverse
applications.
S

Praise for the Previous Edition Now in its fifth edition, its success as a textbook is indicative of
M

its quality and its clarity of presentation. ... The authors also describe the fascinating history
behind some of the key problems in graph theory and, to a lesser extent, their applications. This
eA

book describes the key concepts you need to get started in graph theory. ... It provides all you
might need to know about graph embeddings and graph colorings. Moreover, it analyzes many
th

other topics that more general discrete mathematics monographs do not always cover, such
as network flows, minimum cuts, matchings, factorization, decomposition, and even extremal
to

graph theory. ... This thorough textbook includes hundreds of exercises at the end of each
ed

section. Hints and solutions for odd-numbered exercises are included in the appendix, making
it especially suitable for self-learning. -Fernando Berzal, Computing Reviews, September 2011
at

As with the earlier editions, the current text emphasizes clear exposition, well-written proofs,
ic

and many original and innovative exercises of varying difficulty and challenge. ... The fifth
ed

edition continues and extends these fine traditions. -Arthur T. White, Zentralblatt MATH 1211
From reader reviews:
D

Carlos Wesley: This book untitled Graphs and Digraphs to be one of several books that will
best seller in this year, honestly, that is because when you read this guide you can get a lot of
benefit in it.
Philip Raber: Your reading sixth sense will not betray you, why because this Graphs & Di-
graphs book written by well-known writer who really knows well how to make book that may
be understand by anyone who all read the book. Written inside good manner for you, still
dripping wet every ideas and publishing skill only for eliminate your own hunger then you still
skepticism Graphs and Digraphs as good book not just by the cover but also by content. This is
one reserve that can break don’t judge book by its deal with, so do you still needing a different
sixth sense to pick this!? Oh come on your looking at sixth sense already alerted you so why
6

you have to listening to one more sixth sense.

Mary Hopkins: It is most important to arrange yourself to make your knowledge are still
change. Let’s try to choose correct ways for you.
Virginia Hughes: What is your hobby? Have you heard in which question when you got
learners? We believe that that question was given by teacher for their students. Many kinds of
hobby, All people has different hobby. And also you know that little person such as reading or
as examining become their hobby. You should know that reading is very important in addition
to book as to be the factor. Book is important thing to increase you knowledge, except your
current teacher or lecturer. You find good news or update concerning something by book. Many
kinds of books that can you take to be your object. One of them is this Graphs and Digraphs.

y )
et
ci
Not only is the theory beautiful in its own right, but it also provides one of the keys to a proper

So
understanding of the concept of a graph. Kinds of this book are various. Just viewing or reviewing
it might to be your solve problem if you get difficulties for your knowledge. You can refer to the

al
solutions if necessary.

ic
*** Experimental texts***

at
m
he
at
M
an
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D

Wish you all the best, Mohammadesmail Nikfar

********* **, ****
 y )
et
ci
So
al
ic
at
m
he
at
M
an
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D

S UMMER R ESEARCH , INDEPENDENT SCHOLAR

NIKFARMATH . WORDPRESS . COM

This research was done within a total of ** weeks, from June **th to September *th of ****.

First release, ******* ****

D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 y )
et
ci
So
Contents

al
ic
at
m
he
at
1 M
Graphs, Subgraphs, Connected Graphs . . . . . . . . . . . . . . . . . . . . . . . . 11
an
1.1 Graphs 11
ic

1.1.1 Graphs and Their Representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

er

1.1.2 Isomorphisms and Automorphisms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

m

1.1.3 Graphs Arising from Other Structures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

(A

1.1.4 Constructing Graphs from Other Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

S

1.1.5 Directed Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

M

1.1.6 Infinite Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

eA

1.2 Subgraphs 11
th

1.2.1 Subgraphs and Supergraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

to

1.2.2 Spanning and Induced Subgraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

1.2.3 Modifying Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
ed

1.2.4 Decompositions and Coverings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

at
ic

1.2.5 Edge Cuts and Bonds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

ed

1.2.6 Even Subgraphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

D

1.2.7 Graph Reconstruction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

1.3 Connected Graphs 11

2 Trees, Nonseparable Graphs, Tree-Search Algorithms . . . . . . . . . . . . 13

2.1 Trees 13
2.2 Nonseparable Graphs 13
2.3 Tree-Search Algorithms 13
3 Flows in Networks, Complexity of Algorithms, Connectivity . . . . . . . 15
3.1 Flows in Networks 15
3.2 Complexity of Algorithms 15
3.3 Connectivity 15

4 Planar Graphs, The Four-Colour Problem, Stable Sets and Cliques 17

4.1 Planar Graphs 17

y )
et
4.2 The Four-Colour Problem 17

ci
4.3 Stable Sets and Cliques 17

So
al
5 The Probabilistic Method, Vertex Colourings, Colourings of Map . . 19

ic
5.1 The Probabilistic Method 19

at
m
5.2 Vertex Colourings 19

he
5.3 Colourings of Map 19

at
6
M
Matchings, Edge Colourings, Hamilton Cycles . . . . . . . . . . . . . . . . . . . 21
an

6.1 Matchings 21
ic
er

6.2 Edge Colourings 21

m

6.3 Hamilton Cycles 21

(A

7
S

Coverings and Packings in Directed Graphs, Electrical Networks, In-

M

teger Flows and Coverings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23

eA

7.1 Coverings and Packings in Directed Graphs 23

th

7.2 Electrical Networks 23

to

7.3 Integer Flows and Coverings 23

ed

8
at

Introduction to graphs, Structure and symmetry of graphs, Trees and

ic

connectivity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
ed

8.1 Introduction to graphs 25

D

8.2 Structure and symmetry of graphs 25

8.3 Trees and connectivity 25

9 Eulerian and hamiltonian graphs and digraphs, Directed graphs, Pla-

nar graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
9.1 Eulerian and hamiltonian graphs and digraphs 27
9.2 Directed graphs 27
 11

9.3 Planar graphs 27

10 Graph embeddings, Graph colorings, Matching, factors and decom-

positions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
10.1 Graph embeddings 29
10.2 Graph colorings 29
10.3 Matching, factors and decompositions 29

y )
et
11 Domination in graphs, Extremal graph theory, Ramsey theory, The

ci
probabilistic method in graph theory . . . . . . . . . . . . . . . . . . . . . . . . . . . 31

So
11.1 Domination in graphs 31

al
11.2 Extremal graph theory 31

ic
at
11.3 Ramsey theory 31

m
11.4 The probabilistic method in graph theory 31

he
at
M
an
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
1. Graphs, Subgraphs, Connected Graphs

al
ic
at
m
he
at
1.1 Graphs
1.1.1 Graphs and Their Representation
M
an
1.1.2 Isomorphisms and Automorphisms
ic

1.1.3 Graphs Arising from Other Structures

er

1.1.4 Constructing Graphs from Other Graphs

m

1.1.5 Directed Graphs

(A

1.1.6 Infinite Graphs

S

1.2 Subgraphs
M

1.2.1 Subgraphs and Supergraphs

eA

1.2.2 Spanning and Induced Subgraphs

th

1.2.3 Modifying Graphs

to

1.2.4 Decompositions and Coverings

ed

1.2.5 Edge Cuts and Bonds

at

1.2.6 Even Subgraphs

ic

1.2.7 Graph Reconstruction

ed

1.3 Connected Graphs

D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
2. Trees, Nonseparable Graphs, Tree-Search A

al
ic
at
m
he
at
2.1 Trees
2.2 Nonseparable Graphs
M
an
2.3 Tree-Search Algorithms
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
3. Flows in Networks, Complexity of Algorithms

al
ic
at
m
he
at
3.1 Flows in Networks
3.2 Complexity of Algorithms
M
an
3.3 Connectivity
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
4. Planar Graphs, The Four-Colour Problem, Sta

al
ic
at
m
he
at
4.1 Planar Graphs
4.2 The Four-Colour Problem
M
an
4.3 Stable Sets and Cliques
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
5. The Probabilistic Method, Vertex Colourings,

al
ic
at
m
he
at
5.1 The Probabilistic Method
5.2 Vertex Colourings
M
an
5.3 Colourings of Map
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
6. Matchings, Edge Colourings, Hamilton Cycle

al
ic
at
m
he
at
6.1 Matchings
6.2 Edge Colourings
M
an
6.3 Hamilton Cycles
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
7. Coverings and Packings in Directed Graphs

al
ic
at
m
he
at
7.1 Coverings and Packings in Directed Graphs
7.2 Electrical Networks
M
an
7.3 Integer Flows and Coverings
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
8. Introduction to graphs, Structure and symme

al
ic
at
m
he
at
8.1 Introduction to graphs
8.2 Structure and symmetry of graphs
M
an
8.3 Trees and connectivity
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
9. Eulerian and hamiltonian graphs and digrap

al
ic
at
m
he
at
9.1 Eulerian and hamiltonian graphs and digraphs
9.2 Directed graphs
M
an
9.3 Planar graphs
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
10. Graph embeddings, Graph colorings, Matc

al
ic
at
m
he
at
10.1 Graph embeddings
10.2 Graph colorings
M
an
10.3 Matching, factors and decompositions
ic
er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D
D
ed
ic
at
ed
to
th
eA
M
S
(A
m
er
ic
an
M
at
he
m
at
ic
al
So
ci
et
y )
 ) y
et
ci
So
11. Domination in graphs, Extremal graph theo

al
ic
at
m
he
at
11.1 Domination in graphs
11.2 Extremal graph theory
M
an
11.3 Ramsey theory
ic

11.4 The probabilistic method in graph theory

er
m
(A
S
M
eA
th
to
ed
at
ic
ed
D