scientific article; zbMATH DE number 3557814
The textbook covers some basic areas of graph theory: trees and forests; routes following the edges of a graph; routes covering the vertices of a graph; matching problems, factors; extremal values, extremal graphs. The approach differs from the classical one. Each chapter starts with exercises and problems. There follows a free exposition of the theory: analysis of the problems, remarks, particular solutions, general statements, solutions of problems, suggestions of new problems and generalizations, well motivated introduction of new concepts, new problems etc. This arrangement seems to be very natural and very stimulating, at least for those who want to enjoy mathematical thinking and to solve problems. Second volume (more advanced) is planned to appear.
- A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
- Bifurcation without parameters in circuits with memristors: a DAE approach
- CONDITIONS FOR THE PROPAGATION OF MEMORY PARAMETER FROM DURATIONS TO COUNTS AND REALIZED VOLATILITY
- scientific article; zbMATH DE number 5601298 (Why is no real title available?)
- Graph theory. A problem oriented approach
- scientific article; zbMATH DE number 5570830 (Why is no real title available?)
- Transcritical bifurcation without parameters in memristive circuits
- DAEs in circuit modelling: a survey
- scientific article; zbMATH DE number 3432286 (Why is no real title available?)
- NDC pebbling number for some class of graphs
- Dynamical properties of electrical circuits with fully nonlinear memristors
- On domination numbers of zero-divisor graphs of commutative rings
- On the distributed complexity of the semi-matching problem
- Cyclic matrices of weighted digraphs
- Augmented nodal matrices and normal trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133656)