Hostname: page-component-6bf8c574d5-9nwgx Total loading time: 0 Render date: 2025-02-25T09:13:59.430Z Has data issue: false hasContentIssue false
  • English
  • Français

Some Properties of Graphs with Multiple Edges

Published online by Cambridge University Press:  20 November 2018

D. R. Fulkerson ,
A. J. Hoffman  and
M. H. McAndrew
D. R. Fulkerson
Affiliation:
RAND Corporation and IBM Research Center
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we consider undirected graphs, with no edges joining a vertex to itself, but with possibly several edges joining pairs of vertices. The first part of the paper deals with the question of characterizing those sets of non-negative integers d1d2 . . . , dn and {cij}, 1 ≤ i < j ≤ n, such that there exists a graph G with n vertices whose valences (degrees) are the numbers di, and with the additional property that the number of edges joining i and j is at most cij. This problem has been studied extensively, in the general case (1, 2, 9, 11), in the case where the graph is bipartite (3, 5, 7, 10), and in the case where the Cij are all 1 (6).

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 17 , 1965 , pp. 166 - 177
Copyright
Copyright © Canadian Mathematical Society 1965

References

1. Edmonds, J. R., Paths, trees, and flowers, presented at the Graphs and Combinatorics Conference (Princeton, 1963).Google Scholar
2. Edmonds, J. R., Maximum matchings and a polyhedron with (0, 1)-vertices, presented at the Graphs and Combinatorics Conference (Princeton, 1963).Google Scholar
3. Ford, L. R. Jr. and Fulkerson, D. R., Flows in networks (Princeton, 1962).Google Scholar
4. Fulkerson, D. R. and Ryser, H. J., Multiplicities and minimal widths for (0, 1)-matrices, Can. J. Math., 14 (1962), 498–508.Google Scholar
5. Gale, D., A theorem onflows in networks, Pacific J. Math. 7 (1957), 1073–1082.Google Scholar
6. Hakimi, S. L., On realizability of a set of integers as the degrees of the vertices of a linear graph — I, J. Soc. Ind. and Appl. Math., 10 (1962), 496–507.Google Scholar
7. Hoffman, A. J., Some recent applications of the theory of linear inequalities to extremal combinatorial analysis, Proc. Symp. Appl. Math., 10 (1960), 317–327.Google Scholar
8. Hoffman, A. J. and Kruskal, J. B. Jr., Integral boundary points of convex polyhedra; Linear inequalities and related systems, Annals of Math. Study 88 (Princeton, 1956).Google Scholar
9. Ore, O., Graphs and subgraphs, Trans. Amer. Math. Soc, 84 (1957), 109–137.Google Scholar
10. Ryser, H. J., Combinatorial properties of matrices of zeros and ones, Can. J. Math., 9 (1957), 371–377.Google Scholar
11. Tutte, W. T., The factors of graphs, Can. J. Math., 4 (1952), 314–329.Google Scholar