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

DOI10.1016/S0012-365X(99)00265-4zbMATH Open0959.05061MaRDI QIDQ1978183FDOQ1978183

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)

Cited In (1)

• Title not available (Why is that?)

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Counting acyclic hypergraphs 👍 👎
• On the number of edges in some graphs 👍 👎
• Counting connected graphs asymptotically 👍 👎
• Title not available (Why is that?) 👍 👎

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)