Hostname: page-component-586b7cd67f-2plfb Total loading time: 0 Render date: 2024-11-29T18:22:56.717Z Has data issue: false hasContentIssue false
  • English
  • Français

A generalization of the Königsberg bridges problem

Published online by Cambridge University Press:  24 October 2008

C. Domb
C. Domb
Affiliation:
Wheatstone Physics Laboratory, King's College, London
Get access Rights & Permissions [Opens in a new window]

Abstract

A multi-edge graph is said to be a restricted Euler graph when it can be decomposed into cycles of length greater than 2. Necessary and sufficient conditions are obtained in relation to vertex structure for a graph to be restricted Euler.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 82 , Issue 1 , July 1977 , pp. 1 - 4
Copyright
Copyright © Cambridge Philosophical Society 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Domb, C.Finite cluster partition functions for the D-vector model. J. Phya. A, 9 (1976), 983–998.Google Scholar
(2) See e.g. Busacker, R. G. and Saaty, T. L.Finite Graphe and Networks, ch. 3 (McGraw-Hill, 1965).Google Scholar
(3)Sykes, M. F., Essam, J. W., Heap, B. R. and Hiley, B. J.Lattice constant systems and graph theory. J. Math. Phys. 7 (1966), 1557–1572.CrossRefGoogle Scholar