Graphs with two isomorphism classes of spanning unicycle subgraphs

DOI10.1007/BF01788144MaRDI QIDQ2277482zbMATH OpenFDO

Authors Preben Dahl Vestergaard

Publication date 1991

Published in Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

isomorphism classesspanning unicyclic subgraphs

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 4154494 (Why is no real title available?)
• scientific article; zbMATH DE number 4083675 (Why is no real title available?)
• scientific article; zbMATH DE number 3467129 (Why is no real title available?)
• scientific article; zbMATH DE number 4123753 (Why is no real title available?)
• Graphen, worin je zwei Gerüste isomorph sind
• Graphs with one isomorphism class of spanning unicyclic graphs
• Über Graphen mit isomorphen Gerüsten

Cited in

(7)

• scientific article; zbMATH DE number 4123753 (Why is no real title available?)
• scientific article; zbMATH DE number 867668 (Why is no real title available?)
• 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)