Graphs with all spanning trees nonisomorphic
From MaRDI portal
Publication:1923474
DOI10.1016/0012-365X(94)00363-NzbMath0858.05030OpenAlexW2087212786MaRDI QIDQ1923474
Lars Døvling Andersen, Preben Dahl Vestergaard
Publication date: 23 March 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00363-n
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Graphs with one isomorphism class of spanning unicyclic graphs
- Non-separating induced cycles in graphs
- Graphs with two isomorphism classes of spanning unicycle subgraphs
- Graphen, worin je zwei Gerüste isomorph sind
- Über Graphen mit isomorphen Gerüsten
- The graphs, all of whose spanning trees are isomorphic to each other
This page was built for publication: Graphs with all spanning trees nonisomorphic
