Discrete mathematics
Abstract
Description
Graphs, Part II: More Advanced Notions: 6.1.Γ-Cycles, Cocycles, Cotrees, Flows and Tensions; 6.2.Incidence and Adjacency Matrices of a Graph; 6.3. Eulerian and Hamiltonian Cycles; 6.4.Network Flow Problems; The Max-Flow Min-Cut Theorem;
6.5.Matchings, Coverings, Bipartite Graphs...