Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Attila Joó. Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs. Journal of Graph Theory, 87(1):96-107, 2018. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Edmonds' Branching Theorem in Digraphs Without Forward-Infinite PathsAttila Joó. jgt, 83(3):303-311, 2016. [doi]
The following publications are possibly variants of this publication: