The partition theorem of connected digraphs and its enumerative applications.
From MaRDI portal
Publication:2804790
zbMATH Open1349.05144MaRDI QIDQ2804790FDOQ2804790
Publication date: 4 May 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
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)