Quasi-ordres, intervalles, etc. : une bibliographie

 Access to full text

 Full (PDF)

1. [1] Aigner M., "Graphs and binary relations", in The many facets of graph theory, 1-21, New York, Springer-Verlag, 1969. Zbl0186.27504MR266783
2. [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. Zbl0425.05044
3. [3] Armstrong W.E., "The determinateness of the utility function", Economics Journal, 49, (1939), 453-467. 
4. [4] Armstrong W.E., "Uncertainly and the utility function", Economics Journal, 58, (1948), 1-10. 
5. [5] Armstrong W.E., "A note on the theory of consumer's behavior", Oxford Economic Papers, 2, (1950), 119-122. 
6. [6] Armstrong W.E., "Utility and the theory of welfare", Oxford Economic Papers, 3, (1951), 259-271. 
7. [7] Ascher M., Ascher R., "Chronological ordering by computer", Amer. Anthropologist, 65, (1963), 1045-1052. 
8. [8] Avery P., "Semiorders and representable graphs", in Proceedings of the Fifth British Combinatorial Conference, 5-9, Winnipeg, Utilitas Mathematica, 1976. Zbl0327.05110MR396340
9. [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. Zbl0247.06002MR300944
10. [10] Barbut M., Monjardet B., Ordre et Classification, Algèbre et Combinatoire, Paris, Hachette, 1970. Zbl0267.06001
11. [11] Benzecri J.P. et collaborateurs, L'analyse des données, Tome 2, L'analyse des correspondances, Cn° 9, A.3.1., Dunod, 1973. Zbl0297.62039
12. [12] Benzer S., "On the topology of the genetic fine structure", Proc. Nat. Acad. Sci. USA, 45,(1959), 1607-1620. 
13. [13] Benzer S., "The fine structure of the gene", Scientific American, 206, 1, (1962), 70-84. 
14. [14] Berge C.., Graphes et hypergraphes, Paris, Dunod, 1970. Zbl0213.25702MR357173
15. [15] Berge C.., Graphs and Hypergraphs, Amsterdam, North Holland, 1973. Zbl0254.05101MR366723
16. [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. Zbl0351.06004MR416998
17. [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. Zbl0436.05058MR428757
18. [18] Bouchet A., Etude combinatoire des ordonnés finis, Thèse d'état, Université Scientifique et Médicale deGrenoble, 1971. 
19. [19] Buneman P., "A characterization of rigid circuit graphs", Discrete Math., 9 (1974), 205-212. Zbl0288.05128MR357218
20. [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. [21] Chandon J.L., Lemaire J., Pouget J., "Dénombrement des quasi-ordres sur un ensemble fini", Math. Sci. hum., 62, (1978), 61-80. Zbl0446.06001MR517680
22. [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. [23] Chipman J.S., "The foundations of utility", Econometrica, 28 (1960), 193-224. Zbl0173.48001MR118511
24. [24] Chipman J.S., "Consumption theory without transitive indifference", in Preferences, Utility and Demand, New York, Harcourt Brace, 1971. Zbl0293.90003MR456342
25. [25] Clark, "A survey of statistical problems in archaelogical dating", J. Multiv. Anal., 4 (1974), 308-326. Zbl0286.62081MR362807
26. [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. Zbl0418.06004MR539947
27. [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. Zbl0421.05031
28. [28] Coombs C.H., A theory of data, New York, Wiley, 1964. 
29. [29] Dean R.A. and Keller G., "Natural partial orders", Canad. J. Math., 20 (1968), 535-554. Zbl0174.29701MR225686
30. [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. Zbl0058.13803MR66616
31. [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. [32] Deroo M., "Analyse sensorielle, quasi-ordres et représentations simpliciales ", Math. Sci. hum., 63 (1978), 25-49. Zbl0414.90005
33. [33] Dirac C.A., "On rigid circuit graphs", Abh. Math. Sem. Univ. Hamburg, 25 (1961), 71-76. Zbl0098.14703MR130190
34. [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. Zbl0413.05042
35. [35] Duchet P., "Représentation des familles de Helly", J. Comb. Th. (B), à paraitre. Zbl0413.05042
36. [36] Dunnel R.C., "Seriation method and its evaluation", Am. Antiquity, 35, 3 (1970), 305-319. 
37. [37] Ekman G., "Dimensions of colour vision", J. Psychol., 38 (1954) , 467-474. 
38. [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. [39] Eswaran K.P., "Faithful representation of a family of sets by a set of intervals", SIAM J. Comput., 4, 1(1975), 56-68. Zbl0294.68007MR378509
40. [40] Eytan M., "Matrices ordonnables : une étude algébrique", Math. Sei. hum., 50(1975), 15-22. Zbl0378.06005MR392053
41. [41] Fechner G.T., Elemente der Psychophysik, Leipzig, Breitkof und Hartel, 1860. 
42. [42] Fine N.J., "Proof of a conjecture of Goodman", J. Symbolic Logic, 19 (1954), 41-44. Zbl0055.00402MR59860
43. [43] Fishburn P.C., "Semiorders and risky choices", J. Math. Psychol., 5 (1968), 358-361. Zbl0157.26603
44. [44] Fishburn P.C., "Intransitive indifference in preference theory : a survey", Operations Research, 18, 2(1970), 207-228. Zbl0195.21404MR263445
45. [45] Fishburn P.C., "Intransitive indifference with unequal indifference intervals", J. Math. Psychol., 7 (1970), 144-149. Zbl0191.31501MR253942
46. [46] Fishburn P.C., "An interval graph is not a comparability graph", J. Comb. Th., 8 (1970), 442-443. Zbl0183.28602MR272660
47. [47] Fishburn P.C., "Conditions for simple majority decision functions with intransitive individual indifference", J. Econ. Th., 2 (1970), 354-367. MR449469
48. [48] Fishburn P.C., "Utility theory with inexact preferences and degrees of preference", Synthese, 21 (1970), 204-221. 
49. [49] Fishburn P.C., "Suborders on commodity spaces", J. Econ. Th., 2, 6(1970), 321-328. MR449498
50. [50] Fishburn P.C., Utility theory for decision making, New York, Wiley, 1970. Zbl0213.46202MR264810
51. [51] Fishburn P.C., "Betweenness, orders and interval graphs ", J. pure appl. algebra, 1, 2 (1971), 159-178. Zbl0216.30401MR313134
52. [52] Fishburn P.C., "On the construction of weak orders from fragmentary information", Psychometrika, 38, 4 (1973), 459-472. Zbl0285.06001MR465297
53. [53] Fishburn P.C., "Interval representations for interval orders and semiorders", J. Math. Psychol., 10, (1973), 91-105. Zbl0264.06003MR316322
54. [54] Fishburn P.C., Les mathématiques de la décision, Paris, Gauthier-Villars, 1973 (traduction de Mathematics of decision theory, Mouton, 1972). Zbl0276.62013
55. [55] Fishburn P.C.,The theory of social choice, Princeton, Princeton University Press, 1973. Zbl0253.92006MR386742
56. [56] Fishburn P.C., "Semiorders and choice functions", Econometrica, 43, 5-6 (1975), 975-977. Zbl0313.90002MR441219
57. [57] Fishburn P.C., Gehrlein W.V., "Alternative methods of constructing strict weak orders from interval orders", Psychometrika, 39, 4 (1974), 501-516. Zbl0302.92013MR432254
58. [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. Zbl0324.68071MR406580
59. [59] Fitzerald C.H., "Optimal indexing of the vertices of graphs", Math. Comp., 28 (1974), 825-831. Zbl0295.05117MR379289
60. [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. [61] Flament Cl., "Hypergraphes arborés", Discrete Math., 21 (1978), 223-227. Zbl0393.05039MR522896
62. [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. Zbl0413.05059MR505860
63. [63] Fournier J.C., "Une caractérisation des graphes de cordes", C.R. Acad. Sci. Fr., 286 (1978), 811-813. Zbl0378.05045MR498269
64. [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. Zbl0407.05076
65. [65] Frank A., "Some polynomial algorithms for certain graphs and hypergraphs", in Proc. 5th British Combinatorial Conf., 211-226, Winnipeg, Utilitas Mathematica, 1976. Zbl0328.05141MR392683
66. [66] Fulkerson D.R., Gross O.A.,"Incidence matrices and interval graphs ", Pacific J. Math., 15 (1965), 835-855. Zbl0132.21001MR186421
67. [67] Galanter E.H., "An axiomatic and experimental study of sensory order and measure", Psychological Review, 63, (1956), 16-28. 
68. [68] Gallai T., "Transitiv orientierbare graphen", Acta math. Acad. Sci. hungar., 18 (1967), 25-26. Reviewed in Mathematics Reviews36, n°5026. Zbl0153.26002MR221974
69. [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. Zbl0227.05116MR327580
70. [70] Gavril F., "The intersection graphs of subtrees in trees are exactly the chordal graphs", J. Comb. Th.16 (B), (1974), 47-56. Zbl0266.05101MR332541
71. [71] Gavril F., "An algorithm for testing chordality of graphs", Infor. Process. Lett., 3 (1974/5), 110-112. Zbl0304.05122MR388837
72. [72] Gavril F., "A recognition algorithm for the intersection graphs of directed paths in directed trees", Discrete Math., 13 (1975), 237-249. Zbl0312.05108MR401531
73. [73] Gavril F., "Algorithms on clique separable graphs", Discrete Math., 19 (1977), 159-165. Zbl0378.05042MR491347
74. [74] Gavril F., "A recognition algorithm for the intersection graphs of paths in trees", Discrete Math., 23 (1978), 211-227. Zbl0398.05060MR523072
75. [75] Gelfand A.E., "Seriation methods for archaeological materials", Am. Antiquity, 36 (1971), 263-274. 
76. [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. [77] Georgescu-Roegen N., "The pure theory of consumer's behavior", Quart. J. of Economics, 50 (1936), 545-593. Zbl62.1370.02JFM62.1370.02
78. [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. Zbl0105.35503
79. [79] Gilmore P.C. and Hoffman A.J., "A characterization of comparability graphs and of interval graphs", Canad. J. Math., 16 (1964), 539-548. Zbl0121.26003MR175811
80. [80] Golumbic M.C., "Comparability graphs and a new matroid", J. Comb. Th. (B), 22,1 (1977), 68-90. Zbl0352.05023MR439689
81. [81] Golumbic M.C., "Trivially perfect graphs", Discrete Math., 24 (1978), 105-107. Zbl0384.05057MR522739
82. [82] Goodman N., Structure of appearance, Cambridge, Mass., Harvard University Press, 1951. 
83. [83] Guilbaud G.Th., "Continu expérimental et continu mathématique ", notes de cours (1962) et Math. Sci. hum., 62 (1978), 11-33. Zbl0434.06002
84. [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. MR91236
85. [85] Hajnal A., Suranyi A.J., "Uber die Auflosung von Graphen vollstandige Teilgraphen", Ann. Univ. Sci. Budapest Eötvos Sect. Math., 1 (1958), 113. Zbl0093.37801MR103161
86. [86] Hajos G.," Uber eine Art von Graphen", Internationale Math. Nachrichten, 11 (1957), Sondernummer 65. 
87. [87] Halphen E., "La notion de vraisemblance", Publications de l'I.S.U.P., 4, 1 (1955), 41-92. Zbl0067.10302MR70597
88. [88] Harary F., "A graph theoretic approach to similarity relations", Psychometrika, 29 (1964), 143-151. Zbl0132.40502MR171634
89. [89] HODSON F.R., KENDALL D.G., TÀVUTU P. (eds), Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971. Zbl0254.00020
90. [90] Hole F., Shaw M., Computer analysis of chronological seriation", Rice Univers. Studies, 53, (1967), 1-166. 
91. [91] Holland P.W., "Semiorder theory I : Characterization of semiorders", Memorandum NS 44, Department of Statistics, Harvard University, 1966. 
92. [92] Holland P.W., "Semiorder theory II : Linear semiorders", Memorandum NS 45, Department of Statistics, Harvard University, 1966. 
93. [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. Zbl0285.92029
94. [94] Hubert L.,"Spanning trees and aspects of clustering", Br. J. math. statist. Psychol., 27 (1974), 14-28. Zbl0288.92024
95. [95] Hubert L.J., "Problems of seriation using a subject by item response matrix", Psychol. Bull., 81, 12 (1974), 976-983. 
96. [96] Hubert L.J., "Seriation using asymmetric proximity measures", Brit. J. math. statist. Psychol., 29 (1976), 32-52. Zbl0334.92040MR429180
97. [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. MR525910
98. [98] Hubert L.J., Schultz J., "Quadratic assignment as a general data analysis strategy", Brit. J. math. stat. Psychol., 29 (1976), 190-241. Zbl0356.92027MR443273
99. [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. Zbl0327.90003MR471945
100. [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. [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. Zbl0413.06001MR522222
102. [102] Jamison D.T., Lau L.J., "Semiorders and the theory of choice", Econometrica, 41 (1973), 901-902. Zbl0276.90003MR441217
103. [103] Jamison D.T., Lau L.J., "Semiorders and the theory of choice : a correction", Econometrica, 43, 5-6 (1975), 975-977. Zbl0313.90003MR441219
104. [104] Jamison D.T., Lau L.J., "The nature of equilibrium with semi-ordered preferences", Econometrica, 45, 7 (1977), 595-605. Zbl0369.90011MR496526
105. [105] Kelly J.S., Arrow impossibility theorems, New York, Academic Press, 1978. Zbl0462.90004
106. [106] Kendall D.G., "A statistical approach to Flinders Petrie's sequence dating", Bull. Int. Statist. Inst., 40 (1963),657-680. MR175234
107. [107] Kendall D.G., "Incidence matrices, interval graphs, and seriation in archaeology",Pacific J. Math., 28 (1969), 565-570. Zbl0185.03301MR239990
108. [108] Kendall D.G., "Some problems and methods in statistical archaeology", World Archaeol., 1 (1969), 68-76. 
109. [109] Kendall D.G., "A mathematical approach to seriation", Phil. Trans. R. Soc. Lond., A269 (1971), 125-135. 
110. [110] Kendall D.G., "Abundance matrices and seriation in archaeology", Zschr. Wahrschein, 17 (1971), 104-112. Zbl0203.30903MR289329
111. [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. Zbl0333.62036
112. [112] Kotzig A., "Paare Hajossche Graphen", Casop. Pèst. Mat., 88 (1963), 236-241. Zbl0135.41905MR153000
113. [113] Krantz D.H., "Extensive measurement in semiorder", Philosophy of Science, 34 (1967), 348-362. MR225687
114. [114] Klee V., "What are the intersection graphs of arcs in a circle", Am. Math. Monthly, 7 (1969), 810-813. MR1535525
115. [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. [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. [117] Leclerc B., "Arbres et dimension des ordres", Discrete Math., 14 (1976), 69-76. Zbl0318.06001MR387133
118. [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. Zbl0105.17501MR139159
119. [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. Zbl0243.62040
120. [120] Lerman I.C., "Analyse du phénomène de sériation à partir du tableau d'incidence", Math. Sci. hum., 38 (1972), 39-57. Zbl0243.62040MR303795
121. [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. Zbl0366.05009MR439645
122. [122] Luce R.D., "Semi-orders and a theory of utility discrimination", Econometrica, 24 (1956), 178-191. Zbl0071.14006MR78632
123. [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. [124] Luce R.D., "Three axiom systems for additive semi-ordered structures", SIAM J. Appl. Math., 25 (1973), 41-53. Zbl0238.06014MR319824
125. [125] May K.O., "Intransitivity, utility and the aggregation of preference patterns", Econometrica, 22 (1954), 1-13. MR61811
126. [126] Menuet J., "Quasi-ordres et modélisation des préférences", Note SEMA n°197, (1974), 1-77. 
127. [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. [128] Mirkin B.G., "Description of some relations on the set of real-line intervals", J. Math. Psychol., 9 (1972), 243-252. Zbl0236.06002MR316345
129. [129] Monjardet B., Jacquet-Lagreze E., "Modélisation des préférences et quasi-ordres", Math. Sci. hum., 62 (1978), 5-10. Zbl0416.90004
130. [130] Monjardet B., "Axiomatiques des quasi-ordres", Math. Sci. hum., 63 (1978), 51-82. Zbl0417.06005MR522223
131. [131] Moore J.I. Jr, "Interval hypergraphs and D-interval hypergraphs ", Discrete Math., 17 (1977), 173-179. Zbl0357.05073MR437403
132. [132] Ng Y.K., "Sub-semiorder. A model of multidimensional choice with preference intransitivity", J. Math. Psychol., 16, 1 (1977), 51-59. MR475717
133. [133] Ore O., Theory of graphs, Chapitre 11, Providence, American Mathematical Society, 1962. Zbl0105.35401MR150753
134. [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. Zbl0237.92012
135. [135] Pattanaik P.K., Voting and collective choice, Cambridge, Cambridge University Press, 1971. 
136. [136] Petrie W.M.F., "Sequences in prehistoric remains", J. Anthropol. Inst., 29 (1899), 295-301. 
137. [137] Pnueli A., Lempel A., Even S., "Transitive orientation of graphs and identification of permutation graphs", Canad. J. math., 23, 1 (1971), 160-175. Zbl0204.24604MR292717
138. [138] Poincare H., La science et l'hypothèse, Chapitre 2, Paris, Flammarion, 1902. Zbl34.0080.12JFM34.0080.12
139. [139] Poincare H., La valeur de la science, Chapitre 3, Paris, Flammarion, 1905. 
140. [140] Rabinovitch I., "The Scott-Suppes theorem on semiorders", J. Math. Psychol., 15, 2 (1977), 209-212. Zbl0403.06002MR437404
141. [141] Rabinovitch I., "The dimension of semiorders", J. Comb. Th.(A), 25 (1978), 50-61. Zbl0378.06001MR498294
142. [142] Rabinovitch I., "An upper bound on the dimension of interval orders", J. Comb. Th., (A), 25 (1978), 68-71. Zbl0378.06002MR485598
143. [143] Renfrew C., Sterud G., "Close-proximity analysis : a rapid method for the ordering of archaeological materials", Am. Antiquity, 34 (1969), 265-277. 
144. [144] Renz P.L., "Intersection representations of graphs by arcs", Pacific J. Math., 34 (1970), 501-510. Zbl0191.55103MR270956
145. [145] Riguet J., "Les relations de Ferrers", C.R. Acad. Sci. Fr., 231 (1950), 936-937. Zbl0038.15103MR38936
146. [146] Roberts F.S., On the compatibility between a graph and a simple order, The Rand Corporation, Memorandum RM-5778-PR, 1968. MR252267
147. [147] Roberts F.S., Representations of indifference relations, Unpublished doctoral dissertation, Stanford, Stanford University, 1968. 
148. [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. Zbl0193.24205MR252267
149. [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. Zbl0193.24301MR252268
150. [150] Roberts F.S., "On nontransitive indifference", J. Math. Psychol., 7 (1970), 243-258. Zbl0205.49102MR258486
151. [151] Roberts F.S., "On the compatibility between a graph and a simple order", J. Comb.Th., 11 (1971), 28-38. Zbl0177.27003MR281647
152. [152] Roberts F.S., "Homogeneous families of semiorders and the theory of probabilistic consistency", J. Math. Psychol., 8 (1971), 248-263. Zbl0223.92017MR292534
153. [153] Roberts F.S., Discrete mathematical models with applications to social, biological and environmental problems, New York, Prenctice Hall, 1976. Zbl0363.90002
154. [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. Zbl0389.90036MR504054
155. [155] Roberts F.S., Graph theory and its applications to problems of society, Philadelphia, SIAM, 1978. Zbl0452.05001MR508050
156. [156] Robinson W.S., "A method for chronologically ordering archaeological deposite", Am. Antiquity, 16 (1951), 293-301. 
157. [157] Rogers D.G., "Similarity relations on finite ordered sets", J. Comb. Th. (A), 23 (1977), 88-99. Zbl0366.06001MR457297
158. [158] Rose D.J., "Triangulated graphs and the elimination process", J. Math. Analy., 32 (1970), 597-609. Zbl0216.02602MR270957
159. [159] Scott D., "Measurement structures and linear inequalities", J. Math. Psychol., 1 (1964), 233-247. Zbl0129.12102
160. [160] Scott D., Suppes P., "Foundational aspects of theories of measurement", J. Symbolic Logic, 23 (1958), 113-128. Zbl0084.24603MR115919
161. [161] Sharp H. Jr, "Enumeration of transitive, step-type relations ", Acta math. Acad. Sci. Hung., 22 (1971-72), 365-371. Zbl0236.05006MR347627
162. [162] Shevrin L.N., Filippov N.D., "Partially ordered sets and their comparability graphs", Siberian Math. J., 11 (1970), 497-509. Zbl0214.23303MR269556
163. [163] Sibson R.," Some thoughts on sequencing methods", in Mathematics in the Archaeological and Historical Sciences, Edinburgh, Edinburgh University Press, 1971. Zbl0227.68049
164. [164] Sibson R., "Local order multidimensional scaling", Bull. Inter. Statist. Institute, Proceedings of the 39th session., 1973, Vienne, 45, 4. 
165. [165] Sibson R., "Order invariant methods for data analysis", J. Royal Stat. Soc.B, 34 (1975), 311-349. Zbl0253.62004MR336855
166. [166] Stahl F.W., "Circular genetic maps", J. Cell. Physiol.70 (sup.1) (1967), 1-12. 
167. [167] Sternin H., Statistical methods of time sequencing, Stanford University Department of Statistics, Technical Report n°112, 1965. 
168. [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. [169] Szczotka F.A., "On a method of ordering and clustering of objects", Zastosowania Mathematyki, 13 (1972), 23-33. Zbl0255.62053MR321821
170. [170] Torgerson W.S., Theory and methods of scaling, New York, Wiley, 1958. 
171. [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. Zbl0356.06007MR450140
172. [172] Tucker A.C., Two characterizations of proper circular-arc graphs, Technical Report 69-6, Operations Research House, Stanford, Stanford University, 1969. 
173. [173] Tucker A.C. "Characterizing circular-arc graphs", Am. Math. Monthly, 77 (1970) , 1257-1260. Zbl0204.24401MR276129
174. [174] Tucker A.C., "Matrix characterizations of circular-arc graphs", Pacific J. Math., 39 (1971), 535-545. Zbl0226.05125MR309810
175. [175] Tucker A.C., "A structure theorem for the consecutive l's property", J. Comb. Th., 12 (B) (1972), 153-162. Zbl0208.52402MR295938
176. [176] Tucker A., "Some structure theorems for some circular-arc graphs", Discrete Math., 7 (1974), 167-195. Zbl0269.05119MR379298
177. [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. Zbl0392.05024MR505884
178. [178] Tversky A., "The intransitivity of preferences", Psychol. Review, 76 (1969), 31-48. 
179. [179] Vincke P., "Quasi-ordres généralisés et représentation numérique", Math. Sci. hum., 62 (1978),35-60. Zbl0419.90005MR517679
180. [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. [181] Walter J.R., Representations of rigid cycle graphs, Dissertation, Wayne State University, 1972. 
182. [182] Walter J.R., "Representations of chordal graphs as subtrees of a tree", J. Graph Theory, 2 (1978), 265-267. Zbl0441.05022MR505894
183. [183] Wegner G., Eigenschaften der Nerven Homologisch-einfacher Familien in Rn, Unpublished doctoral dissertation, Göttingen, 1967. 
184. [184] Wiener N., "Contribution to the theory of relative position", Proc. Cambridge philos. Soc., 17 (1912-14), 441-449. JFM45.1150.10
185. [185] Wiener N., "Studies in synthetic logic", Proc. Cambridge philos. Soc., 18 (1914-1916), 14-28. Zbl45.0122.15JFM45.1216.08
186. [186] Wiener N., "A new theory of measurement : a study in the logic of mathematics", Proc. London math. Soc., 19 (1919-1920), 181-205. Zbl47.0040.01JFM47.0040.01
187. [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. Zbl0364.05017
188. [188] Wine R.L., Freund J.E., "On the enumeration of decisions patterns involving n means", Ann. math. Statist., 28 (1957), 256-259. Zbl0078.00905MR84231

1. J. P. Olivier, Liaisons entre les S-relations et les relations de ferrers. Représentations