Balanced Valuations and Flows in Multigraphs
Author:
- F. JaegerFJF. Jaeger
- 1 February 1976
- journal article
- Published by JSTOR in Proceedings of the American Mathematical Society
- Vol. 55 (1) , 237-242
Abstract
A balanced valuation of a multigraph is a mapping of its vertex-set into such that <!-- MATH $\forall S \subseteq V(H)$ --> the number of edges of with exactly one vertex in is greater than or equal to <!-- MATH $|{\sum _{v \in S}}w(v)|$ --> ; we apply the theory of flows in networks to obtain known and new results on balanced valuations such as:
Keywords
This publication has 7 references indexed in Scilit:
- Balanced Colourings and the Four Colour ConjectureProceedings of the American Mathematical Society, 1972
- The Four Color Problem. By Oystein Ore. Pp. ix, 258. 86s. 1967. Monographs in Pure and Applied Mathematics 27. (Academic Press, New York and London.)The Mathematical Gazette, 1968
- A theorem on three-coloring the edges of a trivalent graphJournal of Combinatorial Theory, 1967
- On the degrees of the vertices of a directed graphJournal of the Franklin Institute, 1965
- Lectures on matroidsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Theorem on n-Coloring the Points of a Linear GraphThe American Mathematical Monthly, 1962
- A Contribution to the Theory of Chromatic PolynomialsCanadian Journal of Mathematics, 1954