Realizations with a cut-through Eulerian circuit
- 1 January 1995
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 137 (1-3) , 265-275
- https://doi.org/10.1016/0012-365x(93)e0129-r
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Gauss code problem off the planeAequationes mathematicae, 1987
- 6-Valent analogues of Eberhard’s theoremIsrael Journal of Mathematics, 1974
- The analogue of eberhard’s theorem for 4-valent graphs on the torusIsrael Journal of Mathematics, 1971
- On realizing symmetric 3-polytopesIsrael Journal of Mathematics, 1971
- Properties of planar graphs with uniform vertex and face structure.Memoirs of the American Mathematical Society, 1970
- On p-vectors of 3-polytopesJournal of Combinatorial Theory, 1969
- Planar maps with prescribed types of vertices and facesMathematika, 1969
- Some analogues of eberhard’s theorem on convex polytopesIsrael Journal of Mathematics, 1968