Optimal constructions of event-node networks
Preface, List of papers
Independent face and vertex covers in plane graphs
Review: J. L. Kulikowski; Outline of the theory of graphs
The article contains no abstract
Adjacency matrix equations and related problems: Research notes
A characterization of hypergraphs generated by arborescences
Applied Graph Theory III. Euler and Hamilton graphs. Salesman problem.
A survey of some possible applications of graph theory to numerical analysis is given in part III. They are the following: (1) application of optimal trees to estimating the error in addition processes of positive floating-point numbers, (2) application of graphs to solving systems of linear equations, and (3) application of graphs in rearranging matrices to an easier-to-handle form.
On Hallian digraphs, permanents and transversals
Page 1