Finite and Infinite Graphs Whose Spanning Trees are Pairwise Isomorphic

Preben Dahl Vestergaard

Research output: Contribution to journalJournal articleCommunication

3 Citations (Scopus)
Original languageEnglish
Book seriesAnnals of Discrete Mathematics - Book Series
Volume41
Pages (from-to)421-436
ISSN0167-5060
Publication statusPublished - 1989

Cite this

@article{831bf670809211db8b97000ea68e967b,
title = "Finite and Infinite Graphs Whose Spanning Trees are Pairwise Isomorphic",
author = "Vestergaard, {Preben Dahl}",
year = "1989",
language = "English",
volume = "41",
pages = "421--436",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",

}

Finite and Infinite Graphs Whose Spanning Trees are Pairwise Isomorphic. / Vestergaard, Preben Dahl.

In: Annals of Discrete Mathematics - Book Series, Vol. 41, 1989, p. 421-436.

Research output: Contribution to journalJournal articleCommunication

TY - JOUR

T1 - Finite and Infinite Graphs Whose Spanning Trees are Pairwise Isomorphic

AU - Vestergaard, Preben Dahl

PY - 1989

Y1 - 1989

M3 - Journal article

VL - 41

SP - 421

EP - 436

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

ER -