Symbolic method and directed graph enumeration

MaRDI QIDQ6621253

Sergey Dovgal, Élie de Panafieu

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting acyclic digraphs by sources and sinks
• Enumerative applications of a decomposition for graphs and digraphs
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• The number of strongly connected directed graphs
• Acyclic orientations of graphs
• The critical behavior of random digraphs
• Counting strong digraphs
• The birth of the giant component
• The Number of Strong Digraphs

This page was built for publication: Symbolic method and directed graph enumeration

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