No CrossRef data available.
Article contents
A generalization of the Königsberg bridges problem
Published online by Cambridge University Press: 24 October 2008
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