Graphs with two isomorphism classes of spanning unicycle subgraphs
From MaRDI portal
Publication:2277482
DOI10.1007/BF01788144zbMATH Open0725.05059MaRDI QIDQ2277482FDOQ2277482
Authors: Preben Dahl Vestergaard
Publication date: 1991
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unicyclic graphs with non-isolated resolving number $2$
- Spanning subgraphs of graphs partitioned into two isomorphic pieces
- Graphs with one isomorphism class of spanning unicyclic graphs
- Graphs with all spanning trees nonisomorphic
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
This page was built for publication: Graphs with two isomorphism classes of spanning unicycle subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277482)