Oriented two-dimensional circuits
dc.contributor.author | Dewdney, A. K. | en_US |
dc.contributor.author | Harary, Frank | en_US |
dc.date.accessioned | 2006-04-07T18:11:34Z | |
dc.date.available | 2006-04-07T18:11:34Z | |
dc.date.issued | 1981 | en_US |
dc.identifier.citation | Dewdney, A. K., Harary, Frank (1981)."Oriented two-dimensional circuits." Discrete Mathematics 33(2): 149-162. <http://hdl.handle.net/2027.42/24521> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-45FT6CK-3M/2/879821347662ea1d59c042ce8e7064b9 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/24521 | |
dc.description.abstract | The natural generalization of a directed graph is an oriented complex, a fundamental concept in algebraic topology. Our study of such complexes follows combinatorial rather than topological lines; when an n-circuit is defined for oriented complexes as a structure achieved by a certain minimization process, we are able to pose a question not easily answered by topological methods, but one directly accessible by elementary combinatorial techniques. Indeed, having asked ourselves what structure such n-circuits possess, we were able to find an answer, at least when n = 2. | en_US |
dc.format.extent | 1728663 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Oriented two-dimensional circuits | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationother | Department of Computer Science, University of Western Ontario, London, Ontario, Canada | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/24521/1/0000800.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(81)90162-X | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.