Bridges of longest circuits and path coverings of labelled trees

DOI10.1007/BF01847916zbMath0478.05059OpenAlexW1987159852MaRDI QIDQ1160635

Heinz-Juergen Voss

Publication date: 1982

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01847916

zbMATH Keywords

labelled treespath coveringsbridge of a longest odd circuit

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Interpretierbarkeit und Entscheidbarkeit in der Graphentheorie II
• $ℵ_0$-kategorische zyklenbeschränkte Graphen

This page was built for publication: Bridges of longest circuits and path coverings of labelled trees