The shrinking-and-expanding method for the graph enumeration

DOI10.1515/DMA.1998.8.5.493MaRDI QIDQ4522762zbMATH OpenOpenAlexFDO

Authors

Publication date 7 March 2001

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.1998.8.5.493

zbMATH Keywords

expandinggraph enumerationshrinking

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 15874
• Parameterized Counting and Cayley Graph Expanders
• scientific article; zbMATH DE number 6490941
• scientific article; zbMATH DE number 6322906
• The Complexity of Vertex Enumeration Methods
• The direct expansion of graphs
• An invariant theory approach to graph enumeration
• Constructive enumeration of graphs
• Expander graphs and sieving in combinatorial structures
• scientific article; zbMATH DE number 969981

Cited in

(6)

• Forbidden subgraphs in connected graphs
• Combinatorial enumeration of subdivisible graphs
• scientific article; zbMATH DE number 988746 (Why is no real title available?)
• scientific article; zbMATH DE number 5003363 (Why is no real title available?)
• scientific article; zbMATH DE number 919838 (Why is no real title available?)
• scientific article; zbMATH DE number 3327133 (Why is no real title available?)

This page was built for publication: The shrinking-and-expanding method for the graph enumeration

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