Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T18:21:42.789Z Has data issue: false hasContentIssue false
  • English
  • Français

Antisymmetrical Digraphs

Published online by Cambridge University Press:  20 November 2018

W. T. Tutte
W. T. Tutte*
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Summary

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.

We call a digraph “antisymmetrical” if there is an automorphism θ of its graph, of period 2, which reverses the direction of every edge and maps no edge or vertex onto itself. We construct a theory of flows invariant under θ for such a diagraph. This theory is analogous to the Max Flow Min Cut theory for ordinary flows in digraphs. It is found to include that part of the theory of undirected graphs which discusses the existence of spanning subgraphs with a specified valency at each vertex.

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 19 , 1967, pp. 1101 - 1117
Copyright
Copyright © Canadian Mathematical Society 1967

References

1. Belck, H. B., Reguläre Faktoren von Graphen, J. Reine Angew. Math., 188 (1950), 228–252.Google Scholar
2. Edmonds, J., Paths, trees and flowers, Can. J. Math., 17 (1965), 449–467.Google Scholar
3. Ford, L. R. Jr., and Fulkerson, D. R., Flows in networks (Princeton, 1962).Google Scholar
4. Gallai, T., On factorization of graphs, Acta Math. Acad. Sci. Hungar., 1 (1950), 133–153.Google Scholar
5. Gallai, T., Maximum-minimum Sätze una verallgemeinerte Faktoren von Graphen, Acta Math. Acad. Sci. Hungar., 12 (1961), 131–173.Google Scholar
6. Ore, O., Graphs and subgraphs, I-II, Trans. Amer. Math. Soc., 84 (1957), 109–136 and 93 (1959), 185-204.Google Scholar
7. Petersen, J., Die Theorie der regularen Graphs, Acta Math., 15 (1891), 193–220.Google Scholar
8. Sainte-Lagüe, A., Les réseaux, Mém. Sci. Math. (Paris), 18 (1926).Google Scholar
9. Tutte, W. T., The factorization of linear graphs, J. London Math. Soc., 22 (1947), 107–111.Google Scholar
10. Tutte, W. T., The factors of graphs, Can. J. Math., 4 (1952), 314–328.Google Scholar