Periodica Mathematica Hungarica

September 1982, Volume 13, Issue 3, pp 173–189 | Cite as

Bridges of longest circuits and path coverings of labelled trees

• Authors
• Authors and affiliations

• H. -J. Voss

Article

Received: 26 January 1979

• 17 Downloads
• 1 Citations

AMS (MOS) subject classifications (1970)

Primary 05C35 Secondary 05C05 

Key words and phrases

Longest circuits and paths bridges labelled trees 

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

References

1. [1]
   B. Dahn,8 ₀-kategorische zyklenbeschränkte Graphen,Fund. Math. 80 (1973), 117–131.MR 48 # 3728Google Scholar
2. [2]
   K. Hauschild, H. Herre andW. Rautenberg, Interpretierbarkeit und Entscheidbarkeit in der Graphentheorie, II,Z. Math. Logik Grundlagen Math. 18 (1972), 457–480.MR 48 # 3737Google Scholar
3. [3]
   G. N. Kopylov, O maksimal'nyh putjah i ciklah v grafe (On maximal paths and cycles in a graph),Dokl. Akad. Nauk SSSR 234 (1977), 19–21.MR 57 # 9608Google Scholar
4. [4]
   H.-J. Voss, Maximal circuits and paths in graphs. Extreme cases,Combinatorics (Proc. Colloq., Keszthely, 1976; Colloq. Math. Soc. János Bolyai, 18), North-Holland, Amsterdam, 1978, 1099–1122.MR 80 c:05092Google Scholar
5. [5]
   H.-J. Voss, Open problem,Combinatorics (Proc. Colloq., Keszthely, 1976; Colloq. Math. Soc. János Bolyai, 18), North-Holland, Amsterdam, 1978, 1218.Google Scholar
6. [6]
   H. Walther andH.-J. Voss, Über Kreise in Graphen, VEB Deuscher Verlag der Wissenschaften, Berlin, 1974.Zbl 288. 05101Google Scholar

Copyright information

© Akadémiai Kiadó, Budapest 1982

Authors and Affiliations

• H. -J. Voss
  • 1

1. 1.Sektion Mathematik, Rechentechnik und Ökonomische KybernetikTechnische HochschuleIlmenauGerman Democratic Republic