An edge-deletion problem for locally finite graphs
From MaRDI portal
Publication:1172650
DOI10.1016/0095-8956(82)90067-3zbMath0502.05044OpenAlexW1999476205MaRDI QIDQ1172650
Publication date: 1982
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(82)90067-3
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
On the degrees of vertices in locally finite graphs which possess a certain edge deletion property, On the edge reconstruction of locally finite disconnected graphs with a finite number of components
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the edge reconstruction of locally finite disconnected graphs with a finite number of components
- Über unendliche Wege in Graphen
- Struktur- und Mächtigkeitsuntersuchungen an gewissen unendlichen Graphen mit einigen Anwendungen auf lineare Punktmengen
- On the reconstruction of locally finite trees
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Wurzelbäume und unendliche Wege in Graphen