Journal Article

POLYCHROMATIC ACYCLIC TOURS IN COLORED MULTIGRAPHS.

Mathematics of Operations Research (1983) 8(3) 471-476
DOI: 10.1287/moor.8.3.471
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The authors present two graph-theoretic propositions that provide the basis for a result paralleling K. J Arrow's impossibility theorem.

Cite

CITATION STYLE

APA

Blair, D. H., & Pollak, R. A. (1983). POLYCHROMATIC ACYCLIC TOURS IN COLORED MULTIGRAPHS. Mathematics of Operations Research, 8(3), 471–476. https://doi.org/10.1287/moor.8.3.471

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