Reconstructing some bipartite graphs from their spanning trees

DOI10.1016/0095-8956(80)90084-2MaRDI QIDQ1142229zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1980

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(80)90084-2

zbMATH Keywords

spanning treesreconstructioncomplete bipartite graph

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Reconstructing some bipartite graphs from their spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1142229)