Pendant tree-connectivity
type: Item
instance of: scholarly article
title: Pendant tree-connectivity
zbMATH Open document ID: 0566.05041
DOI: 10.1016/0095-8956(85)90083-8
author: Michael Hager
published in: Journal of Combinatorial Theory. Series B
publication date: 1985-01-01T00:00:00Z
review text: See the preview in Zbl 0542.05042.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3902694
zbMATH Keywords: edge-disjoint trees
zbMATH Keywords: tree-connectivity
MaRDI profile type: Publication
full work available at URL: 0095-8956(85)90083-8
OpenAlex ID: W2049851259
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: Extensions of Menger's Theorem†
cites work: Path-connectivity in graphs
cites work: A theorem on n-connected graphs
cites work: Q3929755
cites work: Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
cites work: On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
cites work: Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
cites work: Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
cites work: 2-linked graphs
cites work: Graph decomposition with applications to subdivisions and path systems modulo k
cites work: On the existence of certain disjoint arcs in graphs
description: scientific article; zbMATH DE number 3902694