Counting enriched multigraphs according to the number of their edges (or arcs)
type: Item
instance of: scholarly article
title: Counting enriched multigraphs according to the number of their edges (or arcs)
zbMATH Open document ID: 0959.05061
DOI: 10.1016/S0012-365X(99)00265-4
author: Gilbert Labelle
published in: Discrete Mathematics
publication date: 2001-04-26T00:00:00Z
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 1453354
zbMATH Keywords: sequences
zbMATH Keywords: multigraphs
zbMATH Keywords: species of combinatorial structures
zbMATH Keywords: enumerations
MaRDI profile type: Publication
Recommended article: Enumeration of graphs with given weighted number of connected components
Recommended article: On the number of edges of separated multigraphs
Recommended article: Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities
Recommended article: Counting connected graphs with large excess
Recommended article: Q4017164
Recommended article: Q3323976
Recommended article: Counting acyclic hypergraphs
Recommended article: On the number of edges in some graphs
Recommended article: Counting connected graphs asymptotically
Recommended article: Q3838221
description: scientific article; zbMATH DE number 1453354