Counting enriched multigraphs according to the number of their edges (or arcs)

DOI10.1016/S0012-365X(99)00265-4MaRDI QIDQ1978183zbMATHFDO

Authors Gilbert Labelle

Publication date 26 April 2001

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

sequencesmultigraphsenumerationsspecies of combinatorial structures

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Enumeration of graphs with given weighted number of connected components
• On the number of edges of separated multigraphs
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
• Counting connected graphs with large excess
• scientific article; zbMATH DE number 91021
• scientific article; zbMATH DE number 3855144
• Counting acyclic hypergraphs
• On the number of edges in some graphs
• Counting connected graphs asymptotically
• scientific article; zbMATH DE number 1185323

Cited in

(2)

• scientific article; zbMATH DE number 2192213 (Why is no real title available?)
• Regularity in weighted graphs a symmetric function approach

This page was built for publication: Counting enriched multigraphs according to the number of their edges (or arcs)

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