Skip to content

Opening book details…

About this Computer Science article

A Matroid Related to Finitely Chainlike, Countably Infinite Networks by A. C. Tucker; A. H. Zemanian is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
A. C. Tucker; A. H. Zemanian
Publisher
John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)
Published
1982
Field
Computer Science (Physical Sciences)

More by A. C. Tucker; A. H. Zemanian

Browse all works by A. C. Tucker; A. H. Zemanian