An edge-deletion problem for locally finite graphs
type: Item
instance of: scholarly article
title: An edge-deletion problem for locally finite graphs
zbMATH Open document ID: 0502.05044
DOI: 10.1016/0095-8956(82)90067-3
author: Thomas Andreae
published in: Journal of Combinatorial Theory. Series B
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3790471
zbMATH Keywords: dyadic tree
zbMATH Keywords: locally finite stable graphs
MaRDI profile type: Publication
full work available at URL: 0095-8956(82)90067-3
OpenAlex ID: W1999476205
cites work: On the reconstruction of locally finite trees
cites work: On the edge reconstruction of locally finite disconnected graphs with a finite number of components
cites work: Q3097395
cites work: Über unendliche Wege in Graphen
cites work: Über die Maximalzahl fremder unendlicher Wege in Graphen
cites work: Q3929755
cites work: Q5572939
cites work: Wurzelbäume und unendliche Wege in Graphen
cites work: Struktur- und Mächtigkeitsuntersuchungen an gewissen unendlichen Graphen mit einigen Anwendungen auf lineare Punktmengen
description: scientific article; zbMATH DE number 3790471