The partition theorem of connected digraphs and its enumerative applications.

MaRDI QIDQ2804790zbMATH OpenFDO

Authors Yufei Huang, Bolian Liu

Publication date 4 May 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

connected graphsrecursive formuladigraphpartition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 1424850
• Some applications of spanning trees in \(K_{s,t}\)
• An algebraic representation of graphs and applications to graph enumeration
• Enumerative applications of a decomposition for graphs and digraphs
• Enumeration of labeled connected graphs with given order and size

Cited in

(4)

• scientific article; zbMATH DE number 1424850 (Why is no real title available?)
• The dissimilarity characteristic theorem for \(k\)-supertrees and its application
• An algebraic representation of graphs and applications to graph enumeration
• Enumerative applications of a decomposition for graphs and digraphs

This page was built for publication: The partition theorem of connected digraphs and its enumerative applications.

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