GRAPHICAL CONFLICT I: A NEW CLASS OF EXTREMAL PROBLEMS
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Kabell, Jerald A. | en_US |
dc.date.accessioned | 2010-06-01T21:03:08Z | |
dc.date.available | 2010-06-01T21:03:08Z | |
dc.date.issued | 1979-05 | en_US |
dc.identifier.citation | Harary, Frank; Kabell, Jerald A. (1979). "GRAPHICAL CONFLICT I: A NEW CLASS OF EXTREMAL PROBLEMS." Annals of the New York Academy of Sciences 319(1 Second International Conference on Combinatorial Mathematics ): 265-269. <http://hdl.handle.net/2027.42/74143> | en_US |
dc.identifier.issn | 0077-8923 | en_US |
dc.identifier.issn | 1749-6632 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/74143 | |
dc.description.abstract | Inspired by the analogy with the three traditional types of conflict in psychology (approach/approach, approach/avoid, and avoid/avoid), we consider corresponding types of extremal problems in graph theory. These are translated into the determination of extremal values of the product or quotient of two graphical parameters, subject to given constraints. For purposes of exemplification, we study and determine both the exact solution and the extremal graphs for several products and quotients which include confrontations of (a) point- and line-independence and covering, (b) connectivity and coloring, (c) covering and connectivity. We conclude with an indication of several unsolved problems for future research. | en_US |
dc.format.extent | 261451 bytes | |
dc.format.extent | 3109 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.publisher | Blackwell Publishing Ltd | en_US |
dc.rights | 1979 The New York Academy of Sciences | en_US |
dc.title | GRAPHICAL CONFLICT I: A NEW CLASS OF EXTREMAL PROBLEMS | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, The University of Michigan, Ann Arbor, Michigan 48109 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/74143/1/j.1749-6632.1979.tb32800.x.pdf | |
dc.identifier.doi | 10.1111/j.1749-6632.1979.tb32800.x | en_US |
dc.identifier.source | Annals of the New York Academy of Sciences | en_US |
dc.identifier.citedreference | Chung, F. R. K., P. ErdÖs & R. L. Graham On the product of the point and line covering numbers of a graph. In this volume, pp. 597. | en_US |
dc.identifier.citedreference | Coombs, C. L. & G. S. Avrunin 1977. Single-peaked functions and the theory of preference. Psychol. Rev. 84: 216 – 230. | en_US |
dc.identifier.citedreference | Gallai, T. 1959. Über extreme Punkt- und Kantenmengen. Ann. Univ. Sci. Budapest, EÖtvÖs Sect. Math. 2: 133 – 138. | en_US |
dc.identifier.citedreference | Harary, F. 1969. The Greek alphabet of graph theory. In Recent Progress in Combinatorics. W. T. Tutte, Ed. Academic Press, New York pp. 13 – 20. | en_US |
dc.identifier.citedreference | Harary, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass. | en_US |
dc.identifier.citedreference | Harary, F., P. C. Kainen, & A. J. Schwenk 1973. Toroidal graphs with arbitrarily high crossing numbers. Nanta Math. 6: 58 – 67. | en_US |
dc.identifier.citedreference | TurÁn, P. 1941. Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok (in Hungarian). 48: 436 – 452. | 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.