Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

The partition theorem of connected digraphs and its enumerative applications.

From MaRDI portal
Publication:2804790
Jump to:navigation, search

zbMATH Open1349.05144MaRDI QIDQ2804790FDOQ2804790

Yufei Huang, Bolian Liu

Publication date: 4 May 2016

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




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)








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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2804790&oldid=15709220"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:31. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki