Graph Theory

Pablo Soberón
Additional contact information
Pablo Soberón: University College London, Department of Mathematics

Chapter 4 in Problem-Solving Methods in Combinatorics, 2013, pp 43-57 from Springer

Abstract: Abstract This chapter contains an introduction to graph theory. The purpose of this chapter is not to give a purely theoretical introduction, so most concepts are shown with problems whose solution involves this idea. First, basic concepts are presented, and important properties of graphs are proven. However, we show how international olympiad problems can be solved using only these basic tools. Then, we study the concepts of connectedness in graphs and properties of trees. We introduce bipartite graphs and some of their properties that can be used frequently for problem-solving (particularly for problems involving boards). Then, we present the concept of matchings and Hall’s “marriage theorem”. At the end of the chapter, 18 problems are shown.

Keywords: Good Segment; Walk Joining; Term Clique; Combinatorial Problem Solving; Beautiful Field (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-0348-0597-1_4

Ordering information: This item can be ordered from
http://www.springer.com/9783034805971

DOI: 10.1007/978-3-0348-0597-1_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().