Largest non-unique subgraphs

DOI10.1007/S00373-006-0676-XzbMath1118.05083OpenAlexW2114777650MaRDI QIDQ882786

Lars Døvling Andersen, Preben Dahl Vestergaard, Zsolt Tuza

Publication date: 24 May 2007

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

Full work available at URL: http://vbn.aau.dk/ws/files/112868/abstractfil2.pdf

zbMATH Keywords

SymmetryAsymmetryRandom graphUnicyclic graphTreeSpanning subgraphEdge deletionIsomorphismReduction numberUnique subgraph

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with one isomorphism class of spanning unicyclic graphs
• On graphs with unique subgraphs
• Graphs with all spanning trees nonisomorphic
• On the number of unique subgraphs
• Asymmetric graphs
• On the number of unique subgraphs of a graph
• On the number of unique subgraphs of a graph

This page was built for publication: Largest non-unique subgraphs