The partition theorem of connected digraphs and its enumerative applications.

zbMATH Open1349.05144MaRDI QIDQ2804790FDOQ2804790

Authors: Yufei Huang, Bolian Liu 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• Publication:4945873
• 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

zbMATH Keywords

partitiondigraphrecursive formulaconnected graphs

Mathematics Subject Classification ID

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

Cited In (4)

• 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
• Title not available (Why is that?)

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)