Journal ArticleOPEN ACCESS

Finding Minimum Generators of Path Systems

Journal of Combinatorial Theory. Series B (1999) 75(2) 237-244
DOI: 10.1006/jctb.1998.1877
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A simple algorithmic proof of a min-max theorem of E. Gyori on generators of path systems is described. The algorithm relies on Dilworth's theorem. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Frank, A. (1999). Finding Minimum Generators of Path Systems. Journal of Combinatorial Theory. Series B, 75(2), 237–244. https://doi.org/10.1006/jctb.1998.1877

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free