-
2
-
-
84994914442
-
Preference structures and threshold models
-
Abbas, M., and Vincke, Ph., ‘Preference structures and threshold models’, J. Multi-Crit. Decis. Anal., 2, 171-178(1993).
-
(1993)
J. Multi-Crit. Decis. Anal.
, vol.2
, pp. 171-178
-
-
Abbas, M.1
Vincke, P.2
-
3
-
-
85040423496
-
A new fundamental preference structure: Threshold order
-
Abbas, M., and Vincke, Ph., ‘A new fundamental preference structure: threshold order’, JORBEL, 1, 1994.
-
(1994)
JORBEL
, vol.1
-
-
Abbas, M.1
Vincke, P.2
-
4
-
-
38249000353
-
Interval choice: Classical and general cases
-
Agaev, R., and Aleskerov, F., ‘Interval choice: classical and general cases’, Math. Social Sci., 26, 249-272(1993).
-
(1993)
Math. Social Sci.
, vol.26
, pp. 249-272
-
-
Agaev, R.1
Aleskerov, F.2
-
6
-
-
0346381524
-
-
Tech. Rep. 246, Department of Computer Science, University of Toronto
-
Cheah, H. K., ‘A recognition algorithm for II-graph’, Tech. Rep. 246, Department of Computer Science, University of Toronto, 1990.
-
(1990)
A recognition algorithm for II-graph
-
-
Cheah, H.K.1
-
7
-
-
0001442849
-
Extensions of permutation and interval graphs
-
Corneil, D. G., and Kamula, P. A., ‘Extensions of permutation and interval graphs’, Congr. Numer., 58, 267-275(1987).
-
(1987)
Congr. Numer.
, vol.58
, pp. 267-275
-
-
Corneil, D.G.1
Kamula, P.A.2
-
8
-
-
38049084478
-
Trapezoid graphs and their coloring
-
Dagan, I., Golumbic, M. C., and Pinter, R. Y., ‘Trapezoid graphs and their coloring’, Discrete Appl. Math., 21, 35-46(1988).
-
(1988)
Discrete Appl. Math.
, vol.21
, pp. 35-46
-
-
Dagan, I.1
Golumbic, M.C.2
Pinter, R.Y.3
-
9
-
-
38249014072
-
Note on: Distance in cocomparability graphs and their powers
-
Damaschke, P., ‘Note on: distance in cocomparability graphs and their powers’, Discrete Appl. Math., 35, 67-72(1992).
-
(1992)
Discrete Appl. Math.
, vol.35
, pp. 67-72
-
-
Damaschke, P.1
-
10
-
-
0000365128
-
Intransitive indifference with unequal indifference intervals
-
Fishburn, P. C., ‘Intransitive indifference with unequal indifference intervals’, J. Math. Psychol., 7, 144-149(1970).
-
(1970)
J. Math. Psychol.
, vol.7
, pp. 144-149
-
-
Fishburn, P.C.1
-
12
-
-
0002521124
-
Transitive orienterbare Graphen
-
Gallaï, T., ‘Transitive orienterbare Graphen’, Acta Math. Sci. Hung., 18, 25-66(1967).
-
(1967)
Acta Math. Sci. Hung.
, vol.18
, pp. 25-66
-
-
Gallaï, T.1
-
13
-
-
0037476523
-
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
-
Ghouïla-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. Paris., 254, 1370-1371(1962).
-
(1962)
C. R. Acad. Sci. Paris.
, vol.254
, pp. 1370-1371
-
-
Ghouïla-Houri, A.1
-
14
-
-
0001288032
-
A characterization of comparability graphs and of interval graphs
-
Gilmore, P. C., and Hoffman, A., ‘A characterization of comparability graphs and of interval graphs’, Can. J. Math., 16, 539-548(1964).
-
(1964)
Can. J. Math.
, vol.16
, pp. 539-548
-
-
Gilmore, P.C.1
Hoffman, A.2
-
15
-
-
0041657580
-
The complexity of comparability graph recognition and coloring
-
Golumbic, M. C., ‘The complexity of comparability graph recognition and coloring’, Computing, 18, 199-208(1977).
-
(1977)
Computing
, vol.18
, pp. 199-208
-
-
Golumbic, M.C.1
-
16
-
-
0013525226
-
Note on trivially perfect graphs
-
Golumbic, M. C., ‘Note on trivially perfect graphs’, Discrete Math., 24, 105-107(1978).
-
(1978)
Discrete Math.
, vol.24
, pp. 105-107
-
-
Golumbic, M.C.1
-
18
-
-
30244562549
-
Recognition of partial orders with interval dimension two via transitive orientation with side constraints
-
Technische Universität, Berlin
-
Habib, M., and Möhring, R. H., ‘Recognition of partial orders with interval dimension two via transitive orientation with side constraints’, Prepr. ‘Reihe Math. 244, Technische Universität, Berlin, 1990.
-
(1990)
Prepr. ‘Reihe Math. 244
-
-
Habib, M.1
Möhring, R.H.2
-
19
-
-
0042736783
-
Über eine Art von Graphen
-
Problem
-
Hajös, G., 'Über eine Art von Graphen’, Int. Math. Nachr., 11, Problem 65(1957).
-
(1957)
Int. Math. Nachr.
, vol.11
, Issue.65
-
-
Hajös, G.1
-
20
-
-
0002215434
-
Representation of a finite graph by a set of intervals on the real line
-
Lekkerkerker, C. G., and Boland, J. Ch., ‘Representation of a finite graph by a set of intervals on the real line’, Fund. Math., 51, 45-64(1962).
-
(1962)
Fund. Math.
, vol.51
, pp. 45-64
-
-
Lekkerkerker, C.G.1
Boland, J.C.2
-
21
-
-
0040295311
-
-
Report, Department of Computer Science, University of Toronto
-
Lerchs, H., ‘On cliques and kernels’, Report, Department of Computer Science, University of Toronto, 1971.
-
(1971)
On cliques and kernels
-
-
Lerchs, H.1
-
22
-
-
0000382439
-
Semiorders and a theory of utility discrimination
-
Luce, R. D., ‘Semiorders and a theory of utility discrimination’, Econometrica, 24, 178-191.
-
Econometrica
, vol.24
, pp. 178-191
-
-
Luce, R.D.1
-
23
-
-
4744341558
-
Equilibre équivalence, ordre et préordre à distance minimum d’un graphe complet
-
Ribeill, G., ‘Equilibre équivalence, ordre et préordre à distance minimum d’un graphe complet’, Math. Sci. Hum., 43, 71-76(1973).
-
(1973)
Math. Sci. Hum.
, vol.43
, pp. 71-76
-
-
Ribeill, G.1
-
24
-
-
0002930970
-
Indifference graphs
-
Harary, F., New York, Academic
-
Roberts, F. S., ‘Indifference graphs’, in Harary, F. (ed.), Proof Techniques in Graph Theory, New York:Academic, 1969, pp. 139-146.
-
(1969)
Proof Techniques in Graph Theory
, pp. 139-146
-
-
Roberts, F.S.1
-
25
-
-
33846016153
-
Linear orders and semiorders close to an interval order
-
Roubens, M., and Vincke, Ph., ‘Linear orders and semiorders close to an interval order’, Discrete Appl. Math., 6, 311-314(1983).
-
(1983)
Discrete Appl. Math.
, vol.6
, pp. 311-314
-
-
Roubens, M.1
Vincke, P.2
-
27
-
-
2442528619
-
Critères multiples et modélisation des préférences: L’apport des relations de surclassement
-
Roy, B., ‘Critères multiples et modélisation des préférences: l’apport des relations de surclassement’, Rev. Econ. Polit., 1, (1974).
-
(1974)
Rev. Econ. Polit.
, vol.1
-
-
Roy, B.1
-
30
-
-
0000427477
-
Foundational aspects of theories of measurement
-
Scott, D., and Suppes, P., ‘Foundational aspects of theories of measurement’, J. Symbol. Logic, 23, 113-128(1958).
-
(1958)
J. Symbol. Logic
, vol.23
, pp. 113-128
-
-
Scott, D.1
Suppes, P.2
-
31
-
-
84910411078
-
Ordres et préordres totaux à distance minimum d’un quasi-ordre
-
Vincke, Ph., ‘Ordres et préordres totaux à distance minimum d’un quasi-ordre’, Cah. Centre Etud. Rech. Opér., 20, 3-4(1978).
-
(1978)
Cah. Centre Etud. Rech. Opér.
, vol.20
, pp. 3-4
-
-
Vincke, P.1
-
32
-
-
0010225214
-
(P, Q, I)-preferences structures
-
Kacprzyck, J. and Roubens, M., Berlin, Springer
-
Vincke, Ph., '(P, Q, I)-preferences structures’, in Kacprzyck, J. and Roubens, M. (eds), Non-Conventional Preference Relations in Decision Making, Berlin:Springer, 1988, pp. 72-81.
-
(1988)
Non-Conventional Preference Relations in Decision Making
, pp. 72-81
-
-
Vincke, P.1
-
34
-
-
0008762825
-
-
Ph.D. Thesis, Universität Göttingen
-
n, Ph.D. Thesis, Universität Göttingen, 1967.
-
(1967)
n
-
-
Wegner, G.1
-
35
-
-
84966200283
-
The comparability graph of a tree
-
Wolk, E. S., ‘The comparability graph of a tree’, Proc. Am. Math. Soc., 3, 789-795(1962).
-
(1962)
Proc. Am. Math. Soc.
, vol.3
, pp. 789-795
-
-
Wolk, E.S.1
-
36
-
-
0013546594
-
A note on the comparability graph of a tree
-
Wolk, E. S., ‘A note on the comparability graph of a tree’, Proc. Am. Math. Soc., 16, 17-20(1965).
-
(1965)
Proc. Am. Math. Soc.
, vol.16
, pp. 17-20
-
-
Wolk, E.S.1
|