Quasi-ordres, intervalles, etc. : une bibliographie

Monjardet, B.; Bresson, D.

Monjardet, B. ; Bresson, D.

Mathématiques et Sciences humaines, Tome 64 (1978), p. 83-92 / Harvested from Numdam

Access to full text
Full (PDF)
Full (DJVU)

Publié le : 1978-01-01

MR 522224 | 1 citation dans Numdam

@article{MSH_1978__63__83_0,
     author = {Monjardet, Bernard and Bresson, Denis},
     title = {Quasi-ordres, intervalles, etc. : une bibliographie},
     journal = {Math\'ematiques et Sciences humaines},
     volume = {64},
     year = {1978},
     pages = {83-92},
     mrnumber = {522224},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/MSH_1978__63__83_0}
}

Monjardet, B.; Bresson, D. Quasi-ordres, intervalles, etc. : une bibliographie. Mathématiques et Sciences humaines, Tome 64 (1978) pp. 83-92. http://gdmltest.u-ga.fr/item/MSH_1978__63__83_0/

Bibliographie

[1] Aigner M., "Graphs and binary relations", in The many facets of graph theory, 1-21, New York, Springer-Verlag, 1969. | MR 266783 | Zbl 0186.27504

[2] Arditti J.C., "Partially ordered sets and their comparability graphs, their dimension and their adjacency", in Problèmes combinatoires et theorie des graphes, Orsay, 1976, 5-11, Paris, CNRS, 1978. | Zbl 0425.05044

[3] Armstrong W.E., "The determinateness of the utility function", Economics Journal, 49, (1939), 453-467.

[4] Armstrong W.E., "Uncertainly and the utility function", Economics Journal, 58, (1948), 1-10.

[5] Armstrong W.E., "A note on the theory of consumer's behavior", Oxford Economic Papers, 2, (1950), 119-122.

[6] Armstrong W.E., "Utility and the theory of welfare", Oxford Economic Papers, 3, (1951), 259-271.

[7] Ascher M., Ascher R., "Chronological ordering by computer", Amer. Anthropologist, 65, (1963), 1045-1052.

[8] Avery P., "Semiorders and representable graphs", in Proceedings of the Fifth British Combinatorial Conference, 5-9, Winnipeg, Utilitas Mathematica, 1976. | MR 396340 | Zbl 0327.05110

[9] Baker K.A., Fishburn P.C., Roberts F.S., "Partial orders of dimension 2, interval orders and interval graphs", The Rand Corporation, P.4376, 1970 and Networks, 2 (1972), 11-28. | MR 300944 | Zbl 0247.06002

[10] Barbut M., Monjardet B., Ordre et Classification, Algèbre et Combinatoire, Paris, Hachette, 1970. | Zbl 0267.06001

[11] Benzecri J.P. et collaborateurs, L'analyse des données, Tome 2, L'analyse des correspondances, Cn° 9, A.3.1., Dunod, 1973. | Zbl 0297.62039

[12] Benzer S., "On the topology of the genetic fine structure", Proc. Nat. Acad. Sci. USA, 45, (1959), 1607-1620.

[13] Benzer S., "The fine structure of the gene", Scientific American, 206, 1, (1962), 70-84.

[14] Berge C.., Graphes et hypergraphes, Paris, Dunod, 1970. | MR 357173 | Zbl 0213.25702

[15] Berge C.., Graphs and Hypergraphs, Amsterdam, North Holland, 1973. | MR 366723 | Zbl 0254.05101

[16] Bogart K.P., Rabinovitch I., Trotterjr W.T., "A bound on the dimension of interval orders", J. Comb. Th. (A), 21 (1976), 319-328. | MR 416998 | Zbl 0351.06004

[17] Booth K.S., Lueker G.S., ''Linear algorithms to recognize interval graphs and test for the consecutive ones property", in Seventh Annual A.C.M. Symposium on theory of computing, 255-265, Assoc. Comput. Mach., New York, 1975. | MR 428757 | Zbl 0436.05058

[18] Bouchet A., Etude combinatoire des ordonnés finis, Thèse d'état, Université Scientifique et Médicale de Grenoble, 1971.

[19] Buneman P., "A characterization of rigid circuit graphs", Discrete Math., 9 (1974), 205-212. | MR 357218 | Zbl 0288.05128

[20] Chandon J.L., Lemaire J., "Agrégation typologique de quasi-ordres, un nouvel algorithme", in Analyse des données et Informatique, 63-76, IRIA, 1977.

[21] Chandon J.L., Lemaire J., Pouget J., "Dénombrement des quasi-ordres sur un ensemble fini", Math. Sci. hum., 62, (1978), 61-80. | Numdam | MR 517680 | Zbl 0446.06001

[22] Charpentier A., Jacquet-Lagreze E., "La promotion de l'électricité dans l'industrie et l'utilisation de méthodes multicritères", Metra, 14, 3(1975), 431-458.

[23] Chipman J.S., "The foundations of utility", Econometrica, 28 (1960), 193-224. | MR 118511 | Zbl 0173.48001

[24] Chipman J.S., "Consumption theory without transitive indifference", in Preferences, Utility and Demand, New York, Harcourt Brace, 1971. | MR 456342 | Zbl 0293.90003

[25] Clark, "A survey of statistical problems in archaelogical dating", J. Multiv. Anal., 4 (1974), 308-326. | MR 362807 | Zbl 0286.62081

[26] Cogis O., "Détermination d'un préordre total contenant un préordre et contenu dans une relation de Ferrers, lorsque leur domaine commun est fini", in Problèmes combinatoires et théorie des graphes, 83-84, Paris, Centre National de la Recherche Scientifique, 1978. | MR 539947 | Zbl 0418.06004

[27] Cogis O., "Graphes de Ferrers et graphes à seuils", in Actes du Colloque Algèbre Appliquée et Combinatoire, Grenoble, Université Scientifique et médicale de Grenoble, 1979. | Zbl 0421.05031

[28] Coombs C.H., A theory of data, New York, Wiley, 1964.

[29] Dean R.A. and Keller G., "Natural partial orders", Canad. J. Math., 20 (1968), 535-554. | MR 225686 | Zbl 0174.29701

[30] Debreu G., "Representation of a preference ordering by a numerical function", in Decision Processes, R.M. Thrall; C.H. Coombs and R.L. Davis, Eds, 159-165, New York, Wiley, 1954. | MR 66616 | Zbl 0058.13803

[31] De La Vega W.F., Deux algorithmes de sériation, in Les méthodes mathématiques de l'archéologie, CADA, CNRS, 1971.

[32] Deroo M., "Analyse sensorielle, quasi-ordres et représentations simpliciales ", Math. Sci. hum., 63 (1978), 25-49. | Numdam | Zbl 0414.90005

[33] Dirac C.A., "On rigid circuit graphs", Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71-76. | MR 130190 | Zbl 0098.14703

[34] Duchet P., "Propriété de Helly et problèmes de représentation", in Problèmes combinatoires et théorie des graphes, Colloque CNRS d'Orsay, Paris, CNRS, 1978. | Zbl 0413.05042

[35] Duchet P., "Représentation des familles de Helly", J. Comb. Th. (B), à paraitre.

[36] Dunnel R.C., "Seriation method and its evaluation", Am. Antiquity, 35, 3 (1970), 305-319.

[37] Ekman G., "Dimensions of colour vision", J. Psychol., 38 (1954) , 467-474.

[38] Eliseeff V., "De l'application des propriétés du scalogramme à l'étude des objets", in Calcul et Formalisation dans les sciences de l'homme, Rome, 1966, Paris, CNRS, 1968.

[39] Eswaran K.P., "Faithful representation of a family of sets by a set of intervals", SIAM J. Comput., 4, 1(1975), 56-68. | MR 378509 | Zbl 0294.68007

[40] Eytan M., "Matrices ordonnables : une étude algébrique", Math. Sei. hum., 50(1975), 15-22. | Numdam | MR 392053 | Zbl 0378.06005

[41] Fechner G.T., Elemente der Psychophysik, Leipzig, Breitkof und Hartel, 1860.

[42] Fine N.J., "Proof of a conjecture of Goodman", J. Symbolic Logic, 19 (1954), 41-44. | MR 59860 | Zbl 0055.00402

[43] Fishburn P.C., "Semiorders and risky choices", J. Math. Psychol., 5 (1968), 358-361. | Zbl 0157.26603

[44] Fishburn P.C., "Intransitive indifference in preference theory : a survey", Operations Research, 18, 2(1970), 207-228. | MR 263445 | Zbl 0195.21404

[45] Fishburn P.C., "Intransitive indifference with unequal indifference intervals", J. Math. Psychol., 7 (1970), 144-149. | MR 253942 | Zbl 0191.31501

[46] Fishburn P.C., "An interval graph is not a comparability graph", J. Comb. Th., 8 (1970), 442-443. | MR 272660 | Zbl 0183.28602

[47] Fishburn P.C., "Conditions for simple majority decision functions with intransitive individual indifference", J. Econ. Th., 2 (1970), 354-367. | MR 449469

[48] Fishburn P.C., "Utility theory with inexact preferences and degrees of preference", Synthese, 21 (1970), 204-221.

[49] Fishburn P.C., "Suborders on commodity spaces", J. Econ. Th., 2, 6(1970), 321-328. | MR 449498

[50] Fishburn P.C., Utility theory for decision making, New York, Wiley, 1970. | MR 264810 | Zbl 0213.46202

[51] Fishburn P.C., "Betweenness, orders and interval graphs ", J. pure appl. algebra, 1, 2 (1971), 159-178. | MR 313134 | Zbl 0216.30401

[52] Fishburn P.C., "On the construction of weak orders from fragmentary information", Psychometrika, 38, 4 (1973), 459-472. | MR 465297 | Zbl 0285.06001

[53] Fishburn P.C., "Interval representations for interval orders and semiorders", J. Math. Psychol., 10, (1973), 91-105. | MR 316322 | Zbl 0264.06003

[54] Fishburn P.C., Les mathématiques de la décision, Paris, Gauthier-Villars, 1973 (traduction de Mathematics of decision theory, Mouton, 1972). | Zbl 0276.62013

[55] Fishburn P.C.,The theory of social choice, Princeton, Princeton University Press, 1973. | MR 386742 | Zbl 0253.92006

[56] Fishburn P.C., "Semiorders and choice functions", Econometrica, 43, 5-6 (1975), 975-977. | MR 441219 | Zbl 0313.90002

[57] Fishburn P.C., Gehrlein W.V., "Alternative methods of constructing strict weak orders from interval orders", Psychometrika, 39, 4 (1974), 501-516. | MR 432254 | Zbl 0302.92013

[58] Fishburn P.C., Gehrlein W.V., "A comparative analysis of method for constructing weak orders from partial orders", J. Math. Sociol., 4, 1, (1975), 93-102. | MR 406580 | Zbl 0324.68071

[59] Fitzerald C.H., "Optimal indexing of the vertices of graphs", Math. Comp., 28 (1974), 825-831. | MR 379289 | Zbl 0295.05117

[60] Flament C., "Comportement de choix et échelle de mesure. I: Etude théorique; II : Etude expérimentale", Bull. C.E.R.P., 9 (1960), 165-186.

[61] Flament Cl., "Hypergraphes arborés", Discrete Math., 21 (1978), 223-227. | MR 522896 | Zbl 0393.05039

[62] Foldes S., Hammer P.L., "On split graphs and some related questions", in Problèmes combinatoires et théorie des graphes, 139-140, Paris, CNRS, 1978. | MR 505860 | Zbl 0413.05059

[63] Fournier J.C., "Une caractérisation des graphes de cordes", C.R. Acad. Sci. Fr., 286 (1978), 811-813. | MR 498269 | Zbl 0378.05045

[64] Fournier J.C., "Graphes de cordes, hypergraphes de chaines et matroïdes graphiques", in Actes du Colloque Algèbre appliquée et Combinatoire, Grenoble, Université scientifique et médicale de Grenoble, 1979. | Zbl 0407.05076

[65] Frank A., "Some polynomial algorithms for certain graphs and hypergraphs", in Proc. 5th British Combinatorial Conf., 211-226, Winnipeg, Utilitas Mathematica, 1976. | MR 392683 | Zbl 0328.05141

[66] Fulkerson D.R., Gross O.A., "Incidence matrices and interval graphs ", Pacific J. Math., 15 (1965), 835-855. | MR 186421 | Zbl 0132.21001

[67] Galanter E.H., "An axiomatic and experimental study of sensory order and measure", Psychological Review, 63, (1956), 16-28.

[68] Gallai T., "Transitiv orientierbare graphen", Acta math. Acad. Sci. hungar., 18 (1967), 25-26. Reviewed in Mathematics Reviews 36, n°5026. | MR 221974 | Zbl 0153.26002

[69] Gavril F., "Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph", SIAM J. Comp. 1 (1972), 180-187. | MR 327580 | Zbl 0227.05116

[70] Gavril F., "The intersection graphs of subtrees in trees are exactly the chordal graphs", J. Comb. Th. 16 (B), (1974), 47-56. | MR 332541 | Zbl 0266.05101

[71] Gavril F., "An algorithm for testing chordality of graphs", Infor. Process. Lett., 3 (1974/5), 110-112. | MR 388837 | Zbl 0304.05122

[72] Gavril F., "A recognition algorithm for the intersection graphs of directed paths in directed trees", Discrete Math., 13 (1975), 237-249. | MR 401531 | Zbl 0312.05108

[73] Gavril F., "Algorithms on clique separable graphs", Discrete Math., 19 (1977), 159-165. | MR 491347 | Zbl 0378.05042

[74] Gavril F., "A recognition algorithm for the intersection graphs of paths in trees", Discrete Math., 23 (1978), 211-227. | MR 523072 | Zbl 0398.05060

[75] Gelfand A.E., "Seriation methods for archaeological materials", Am. Antiquity, 36 (1971), 263-274.

[76] Gelfand A.E., "Rapid seriation methods with archaeological applications", in F.R. Hodson et al (eds), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971.

[77] Georgescu-Roegen N., "The pure theory of consumer's behavior", Quart. J. of Economics, 50 (1936), 545-593. | JFM 62.1370.02

[78] Ghouila-Houri A., "Caractérisation des graphes non orientés dont on peut orienter les arêtes de manière à obtenir le graphe d'une relation d'ordre", C.R. Acad. Sci. Fr., 254 (1962), 370. | Zbl 0105.35503

[79] Gilmore P.C. and Hoffman A.J., "A characterization of comparability graphs and of interval graphs", Canad. J. Math., 16 (1964), 539-548. | MR 175811 | Zbl 0121.26003

[80] Golumbic M.C., "Comparability graphs and a new matroid", J. Comb. Th. (B), 22,1 (1977), 68-90. | MR 439689 | Zbl 0352.05023

[81] Golumbic M.C., "Trivially perfect graphs", Discrete Math., 24 (1978), 105-107. | MR 522739 | Zbl 0384.05057

[82] Goodman N., Structure of appearance, Cambridge, Mass., Harvard University Press, 1951.

[83] Guilbaud G.Th., "Continu expérimental et continu mathématique ", notes de cours (1962) et Math. Sci. hum., 62 (1978), 11-33. | Numdam | Zbl 0434.06002

[84] Guttman L., "A new approach to factor analysis : the Radex, in P. Lazarsfeld (ed.), Mathematical Thinking in the Social Sciences, New York, Free Press, 1954. | MR 91236

[85] Hajnal A., Suranyi A.J., "Uber die Auflosung von Graphen vollstandige Teilgraphen", Ann. Univ. Sci. Budapest Eötvos Sect. Math., 1 (1958), 113. | MR 103161 | Zbl 0093.37801

[86] Hajos G.," Uber eine Art von Graphen", Internationale Math. Nachrichten, 11 (1957), Sondernummer 65.

[87] Halphen E., "La notion de vraisemblance", Publications de l'I.S.U.P., 4, 1 (1955), 41-92. | MR 70597 | Zbl 0067.10302

[88] Harary F., "A graph theoretic approach to similarity relations", Psychometrika, 29 (1964), 143-151. | MR 171634 | Zbl 0132.40502

[89] HODSON F.R., KENDALL D.G., TÀVUTU P. (eds), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971. | Zbl 0254.00020

[90] Hole F., Shaw M., Computer analysis of chronological seriation", Rice Univers. Studies, 53, (1967), 1-166.

[91] Holland P.W., "Semiorder theory I : Characterization of semiorders", Memorandum NS 44, Department of Statistics, Harvard University, 1966.

[92] Holland P.W., "Semiorder theory II : Linear semiorders", Memorandum NS 45, Department of Statistics, Harvard University, 1966.

[93] Hubert L., "Some applications of graph theory and related non-metrictechniques to problems of approximate seriation : the case of symmetric proximity measures", Br. J. math. statist. Psychol., 27, 2 (1974), 133-153. | Zbl 0285.92029

[94] Hubert L., "Spanning trees and aspects of clustering", Br. J. math. statist. Psychol., 27 (1974), 14-28. | Zbl 0288.92024

[95] Hubert L.J., "Problems of seriation using a subject by item response matrix", Psychol. Bull., 81, 12 (1974), 976-983.

[96] Hubert L.J., "Seriation using asymmetric proximity measures", Brit. J. math. statist. Psychol., 29 (1976), 32-52. | MR 429180 | Zbl 0334.92040

[97] Hubert L.J., Baker F.B., "Applications of combinatorial programming to data analysis : the traveling salesman and related problems", Psychometrika, 43, 1 (1978), 81-91. | MR 525910

[98] Hubert L.J., Schultz J., "Quadratic assignment as a general data analysis strategy", Brit. J. math. stat. Psychol., 29 (1976), 190-241. | MR 443273 | Zbl 0356.92027

[99] Jacquet-Lagreze E., "How we can use the notion of semiorders to build outranking relations in multicriteria decision making", in Utility, subjective Probability and human decision making, ed. C. Vlek et P. Wendt, D. Reidel, 1975 et Metra, 13, 1 (1974), 59-86. | MR 471945 | Zbl 0327.90003

[100] Jacquet-Lagreze E., La modélisation des préférences ; préordres, quasi-ordres et relations floues, Thèse de 3ème Cycle, Université Paris-V, 1975.

[101] Jacquet-Lagreze E., "Représentation de quasi-ordres et de relations probabilistes transitives sous forme standard et méthodes d'approximation", Math. Sci. hum., 63 (1978), 5-24. | Numdam | MR 522222

[102] Jamison D.T., Lau L.J., "Semiorders and the theory of choice", Econometrica, 41 (1973), 901-902. | MR 441217 | Zbl 0276.90003

[103] Jamison D.T., Lau L.J., "Semiorders and the theory of choice : a correction", Econometrica, 43, 5-6 (1975), 975-977. | MR 441219 | Zbl 0313.90003

[104] Jamison D.T., Lau L.J., "The nature of equilibrium with semi-ordered preferences", Econometrica, 45, 7 (1977), 595-605. | MR 496526 | Zbl 0369.90011

[105] Kelly J.S., Arrow impossibility theorems, New York, Academic Press, 1978. | Zbl 0462.90004

[106] Kendall D.G., "A statistical approach to Flinders Petrie's sequence dating", Bull. Int. Statist. Inst., 40 (1963),657-680. | MR 175234

[107] Kendall D.G., "Incidence matrices, interval graphs, and seriation in archaeology",Pacific J. Math., 28 (1969), 565-570. | MR 239990 | Zbl 0185.03301

[108] Kendall D.G., "Some problems and methods in statistical archaeology", World Archaeol., 1 (1969), 68-76.

[109] Kendall D.G., "A mathematical approach to seriation", Phil. Trans. R. Soc. Lond., A 269 (1971), 125-135.

[110] Kendall D.G., "Abundance matrices and seriation in archaeology", Zschr. Wahrschein, 17 (1971), 104-112. | MR 289329 | Zbl 0203.30903

[111] Kendall D.G., "Seriation from abundance matrices", in F.R. Hodson et al (eds), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971.

[112] Kotzig A., "Paare Hajossche Graphen", Casop. Pèst. Mat., 88 (1963), 236-241. | MR 153000 | Zbl 0135.41905

[113] Krantz D.H., "Extensive measurement in semiorder", Philosophy of Science, 34 (1967), 348-362. | MR 225687

[114] Klee V., "What are the intersection graphs of arcs in a circle", Am. Math. Monthly, 7 (1969), 810-813. | MR 1535525

[115] Kuzara R.S., Mead G.R., Dixon K.A., "Seriation of anthropological data : a computer program for matrix ordering", Amer. Anthropologist, 68, 6 (1965), 1442-1455.

[116] Landau J., DE LA Vega F., "A new seriation algorithm applied to European protohistoric anthropomorphic statuary", in F.R. Hodson et al (eds), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971.

[117] Leclerc B., "Arbres et dimension des ordres", Discrete Math., 14 (1976), 69-76. | MR 387133 | Zbl 0318.06001

[118] Lekkerkerker C.G., Boland J.C., "Representation of a finite graph by a set of intervals on the real line", Fund. Math., 51 (1962), 45-64. | MR 139159 | Zbl 0105.17501

[119] Lerman I.C. "Analyse du phénomène de la sériation à partir d'un tableau d'incidence ", in Les méthodes mathématiques de l'archéologie, CADA, CNRS, 1971.

[120] Lerman I.C., "Analyse du phénomène de sériation à partir du tableau d'incidence", Math. Sci. hum., 38 (1972), 39-57. | Numdam | MR 303795 | Zbl 0243.62040

[121] Lipski W. Jr, Nakano T., "A note on the consecutive l's property (infinité case)", Comment. Math. Univ. St Paul, 2 (1976-77), 149-152. | MR 439645 | Zbl 0366.05009

[122] Luce R.D., "Semi-orders and a theory of utility discrimination", Econometrica, 24 (1956), 178-191. | MR 78632 | Zbl 0071.14006

[123] Luce R.D., Suppes P., "Preference, utility and subjective probability", in R.D. Luce, R.R. Bush and E. Galanter (eds), Handbook of mathematical psychology, III, 249-410, New York, Wiley, 1965.

[124] Luce R.D., "Three axiom systems for additive semi-ordered structures", SIAM J. Appl. Math., 25 (1973), 41-53. | MR 319824 | Zbl 0238.06014

[125] May K.O., "Intransitivity, utility and the aggregation of preference patterns", Econometrica, 22 (1954), 1-13. | MR 61811

[126] Menuet J., "Quasi-ordres et modélisation des préférences", Note SEMA n°197, (1974), 1-77.

[127] Millier C., Tomassone R.E., "Méthodes d'ordination et de classification: leur efficacité et leurs limites", in Archéologie et calculateurs, Paris, CNRS, 1970.

[128] Mirkin B.G., "Description of some relations on the set of real-line intervals", J. Math. Psychol., 9 (1972), 243-252. | MR 316345 | Zbl 0236.06002

[129] Monjardet B., Jacquet-Lagreze E., "Modélisation des préférences et quasi-ordres", Math. Sci. hum., 62 (1978), 5-10. | Numdam | Zbl 0416.90004

[130] Monjardet B., "Axiomatiques des quasi-ordres", Math. Sci. hum., 63 (1978), 51-82. | Numdam | MR 522223 | Zbl 0417.06005

[131] Moore J.I. Jr, "Interval hypergraphs and D-interval hypergraphs ", Discrete Math., 17 (1977), 173-179. | MR 437403 | Zbl 0357.05073

[132] Ng Y.K., "Sub-semiorder. A model of multidimensional choice with preference intransitivity", J. Math. Psychol., 16, 1 (1977), 51-59. | MR 475717

[133] Ore O., Theory of graphs, Chapitre 11, Providence, American Mathematical Society, 1962. | MR 150753 | Zbl 0105.35401

[134] Parlebas P., "Effet Condorcet et dynamique sociométrique. I : l'ordre de préférence au niveau individuel", Math. Sci. hum., 36 (1971), 5-31. II : Incohérences rationnelles et cohésions groupales", Math. Sci. hum., 37 (1972), 37-67. | Numdam | Zbl 0237.92012

[135] Pattanaik P.K., Voting and collective choice, Cambridge, Cambridge University Press, 1971.

[136] Petrie W.M.F., "Sequences in prehistoric remains", J. Anthropol. Inst., 29 (1899), 295-301.

[137] Pnueli A., Lempel A., Even S., "Transitive orientation of graphs and identification of permutation graphs", Canad. J. math., 23, 1 (1971), 160-175. | MR 292717 | Zbl 0204.24604

[138] Poincare H., La science et l'hypothèse, Chapitre 2, Paris, Flammarion, 1902. | JFM 34.0080.12

[139] Poincare H., La valeur de la science, Chapitre 3, Paris, Flammarion, 1905.

[140] Rabinovitch I., "The Scott-Suppes theorem on semiorders", J. Math. Psychol., 15, 2 (1977), 209-212. | MR 437404 | Zbl 0403.06002

[141] Rabinovitch I., "The dimension of semiorders", J. Comb. Th.(A), 25 (1978), 50-61. | MR 498294 | Zbl 0378.06001

[142] Rabinovitch I., "An upper bound on the dimension of interval orders", J. Comb. Th., (A), 25 (1978), 68-71. | MR 485598 | Zbl 0378.06002

[143] Renfrew C., Sterud G., "Close-proximity analysis : a rapid method for the ordering of archaeological materials", Am. Antiquity, 34 (1969), 265-277.

[144] Renz P.L., "Intersection representations of graphs by arcs", Pacific J. Math., 34 (1970), 501-510. | MR 270956 | Zbl 0191.55103

[145] Riguet J., "Les relations de Ferrers", C.R. Acad. Sci. Fr., 231 (1950), 936-937. | MR 38936 | Zbl 0038.15103

[146] Roberts F.S., On the compatibility between a graph and a simple order, The Rand Corporation, Memorandum RM-5778-PR, 1968. | MR 252267

[147] Roberts F.S., Representations of indifference relations, Unpublished doctoral dissertation, Stanford, Stanford University, 1968.

[148] Roberts F.S., "Indifference graphs", in F. Harary (Ed.), Proof techniques in graph theory: Proceedings of the Second Ann Arbor Theory Conference, 139-146, New York, Academic Press, 1969. | MR 252267 | Zbl 0193.24205

[149] Roberts F.S., "On the boxicity and the cubicity of a graph", in W.T. Tutte (Ed.), Recent progress in combinatorics: Proceedings of the Third Waterloo Conference, 301-310, New York, Academic Press, 1969. | MR 252268 | Zbl 0193.24301

[150] Roberts F.S., "On nontransitive indifference", J. Math. Psychol., 7 (1970), 243-258. | MR 258486 | Zbl 0205.49102

[151] Roberts F.S., "On the compatibility between a graph and a simple order", J. Comb.Th., 11 (1971), 28-38. | MR 281647 | Zbl 0177.27003

[152] Roberts F.S., "Homogeneous families of semiorders and the theory of probabilistic consistency", J. Math. Psychol., 8 (1971), 248-263. | MR 292534 | Zbl 0223.92017

[153] Roberts F.S., Discrete mathematical models with applications to social, biological and environmental problems, New York, Prenctice Hall, 1976. | Zbl 0363.90002

[154] Roberts F.S., "Food webs, competition graphs and the boxicitv of ecological phase space", in Theory and Applications of graphs, 477-490, Lecture Notes in Math. 642, New York, Springer Verlag, 1978. | MR 504054 | Zbl 0389.90036

[155] Roberts F.S., Graph theory and its applications to problems of society, Philadelphia, SIAM, 1978. | MR 508050 | Zbl 0452.05001

[156] Robinson W.S., "A method for chronologically ordering archaeological deposite", Am. Antiquity, 16 (1951), 293-301.

[157] Rogers D.G., "Similarity relations on finite ordered sets", J. Comb. Th. (A), 23 (1977), 88-99. | MR 457297 | Zbl 0366.06001

[158] Rose D.J., "Triangulated graphs and the elimination process", J. Math. Analy., 32 (1970), 597-609. | MR 270957 | Zbl 0216.02602

[159] Scott D., "Measurement structures and linear inequalities", J. Math. Psychol., 1 (1964), 233-247. | Zbl 0129.12102

[160] Scott D., Suppes P., "Foundational aspects of theories of measurement", J. Symbolic Logic, 23 (1958), 113-128. | MR 115919 | Zbl 0084.24603

[161] Sharp H. Jr, "Enumeration of transitive, step-type relations ", Acta math. Acad. Sci. Hung., 22 (1971-72), 365-371. | MR 347627 | Zbl 0236.05006

[162] Shevrin L.N., Filippov N.D., "Partially ordered sets and their comparability graphs", Siberian Math. J., 11 (1970), 497-509. | MR 269556 | Zbl 0214.23303

[163] Sibson R.," Some thoughts on sequencing methods", in Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971.

[164] Sibson R., "Local order multidimensional scaling", Bull. Inter. Statist. Institute, Proceedings of the 39th session., 1973, Vienne, 45, 4.

[165] Sibson R., "Order invariant methods for data analysis", J. Royal Stat. Soc. B, 34 (1975), 311-349. | MR 336855 | Zbl 0253.62004

[166] Stahl F.W., "Circular genetic maps", J. Cell. Physiol. 70 (sup.1) (1967), 1-12.

[167] Sternin H., Statistical methods of time sequencing, Stanford University Department of Statistics, Technical Report n°112, 1965.

[168] Suppes P., Zinnes J., "Basic measurement theory", in R.D.Luce, R.R.Bush, and E. Galanter (eds.), Handbook of Mathematical Psychology, I, 1-76, New York, Wiley, 1963.

[169] Szczotka F.A., "On a method of ordering and clustering of objects", Zastosowania Mathematyki, 13 (1972), 23-33. | MR 321821 | Zbl 0255.62053

[170] Torgerson W.S., Theory and methods of scaling, New York, Wiley, 1958.

[171] Trotter W.T. Jr, Moore J.I. Jr, "Characterization problems for graphs, partially ordered sets, lattices and families of sets", Discrete Math., 16 (1976), 361-381. | MR 450140 | Zbl 0356.06007

[172] Tucker A.C., Two characterizations of proper circular-arc graphs, Technical Report 69-6, Operations Research House, Stanford, Stanford University, 1969.

[173] Tucker A.C. "Characterizing circular-arc graphs", Am. Math. Monthly, 77 (1970) , 1257-1260. | MR 276129 | Zbl 0204.24401

[174] Tucker A.C., "Matrix characterizations of circular-arc graphs", Pacific J. Math., 39 (1971), 535-545. | MR 309810 | Zbl 0226.05125

[175] Tucker A.C., "A structure theorem for the consecutive l's property", J. Comb. Th., 12 (B) (1972), 153-162. | MR 295938 | Zbl 0208.52402

[176] Tucker A., "Some structure theorems for some circular-arc graphs", Discrete Math., 7 (1974), 167-195. | MR 379298 | Zbl 0269.05119

[177] Tucker A.C., "Circular-arc graphs, new uses and a new algorithm", in Theory and Applications of graphs, ed. Alavi Y. and Lick D. R., 580-589, Lecture Notes in Math. 642, New York, Springer Verlag, 1978. | MR 505884 | Zbl 0392.05024

[178] Tversky A., "The intransitivity of preferences", Psychol. Review, 76 (1969), 31-48.

[179] Vincke P., "Quasi-ordres généralisés et représentation numérique", Math. Sci. hum., 62 (1978),35-60. | Numdam | MR 517679 | Zbl 0419.90005

[180] Vincke P., Concept de quasi-ordre généralisé et théorèmes de représentation thèse de doctorat, Université Libre de Bruxelles, 1976.

[181] Walter J.R., Representations of rigid cycle graphs, Dissertation, Wayne State University, 1972.

[182] Walter J.R., "Representations of chordal graphs as subtrees of a tree", J. Graph Theory, 2 (1978), 265-267. | MR 505894 | Zbl 0441.05022

[183] Wegner G., Eigenschaften der Nerven Homologisch-einfacher Familien in Rn, Unpublished doctoral dissertation, Göttingen, 1967.

[184] Wiener N., "Contribution to the theory of relative position", Proc. Cambridge philos. Soc., 17 (1912-14), 441-449. | JFM 45.1150.10

[185] Wiener N., "Studies in synthetic logic", Proc. Cambridge philos. Soc., 18 (1914-1916), 14-28. | JFM 45.1216.08

[186] Wiener N., "A new theory of measurement : a study in the logic of mathematics", Proc. London math. Soc., 19 (1919-1920), 181-205. | JFM 47.0040.01

[187] Wilkinson E.M., "Archaeological seriation and the traveling salesman problem, in F.R. Hodson et al (eds.), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971.

[188] Wine R.L., Freund J.E., "On the enumeration of decisions patterns involving n means", Ann. math. Statist., 28 (1957), 256-259. | MR 84231 | Zbl 0078.00905