
This chapter deals with basic graph theoretical concepts and then focuses on special topics which are — in their applications — of relevance to theoretical and practical problems in OR. Therefore, this chapter is structured as follows: 1. Basics of Graph Theory. 2. Connectivity, Menger’s Theorem, the Splitting Lemma, and Factors. 3. Eulerian Graphs and Covering Walks, Cycle Decompositions and Cycle Covers. 4. Hamiltonian Cycles and Vertex-Covering Walks. 5. Elements of Matching Theory. 6. The Chinese Postman Problem, The Traveling Salesman Problem, and Related Problems. 7. Elements of Network Theory.
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
