The number of strongly connected directed graphs

DOI10.1007/BF01673687zbMath0217.31001OpenAlexW2086672051MaRDI QIDQ2546350

Valery A. Liskovets

Publication date: 1971

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01673687

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

The birth of the strong components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of bi-colored graphs
• Kombinatorische Anzahlbestimmungen in Relationen
• Enumeration Of Labelled Graphs
• The Number of Linear, Directed, Rooted, and Connected Graphs

This page was built for publication: The number of strongly connected directed graphs