Year |
Citation |
Score |
2009 |
Dreyer PA, Roberts FS. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion Discrete Applied Mathematics. 157: 1615-1627. DOI: 10.1016/J.Dam.2008.09.012 |
0.655 |
|
2006 |
Fishburn PC, Roberts FS. Full color theorems for L(2, 1)-colorings Siam Journal On Discrete Mathematics. 20: 428-443. DOI: 10.1137/S0895480100378562 |
0.34 |
|
2003 |
Roberts FS, Xu S. Characterizations of consistent marked graphs Discrete Applied Mathematics. 127: 357-371. DOI: 10.1016/S0166-218X(02)00254-8 |
0.39 |
|
2001 |
Pekeč A, Roberts FS. The role assignment model nearly fits most social networks Mathematical Social Sciences. 41: 275-293. DOI: 10.1016/S0165-4896(00)00064-0 |
0.375 |
|
2001 |
Roberts FS, Sheng L. How hard is it to determine if a graph has a 2-role assignment? Networks. 37: 67-73. DOI: 10.1002/1097-0037(200103)37:2<67::Aid-Net1>3.0.Co;2-9 |
0.379 |
|
2000 |
Roberts FS, Sheng L. Phylogeny numbers for graphs with two triangles Discrete Applied Mathematics. 103: 191-207. DOI: 10.1016/S0166-218X(99)00209-7 |
0.362 |
|
1999 |
Roberts FS. On balanced signed graphs and consistent marked graphs Electronic Notes in Discrete Mathematics. 2: 94-105. DOI: 10.1016/S1571-0653(04)00017-4 |
0.385 |
|
1998 |
McMorris FR, Mulder HM, Roberts FS. The median procedure on median graphs Discrete Applied Mathematics. 84: 165-181. DOI: 10.1016/S0166-218X(98)00003-1 |
0.361 |
|
1997 |
Kim SR, Roberts FS. Competition numbers of graphs with a small number of triangles Discrete Applied Mathematics. 78: 153-162. DOI: 10.1016/S0166-218X(97)00026-7 |
0.39 |
|
1995 |
Roberts FS. On the problem of consistent marking of a graph Linear Algebra and Its Applications. 217: 255-263. DOI: 10.1016/0024-3795(94)00193-H |
0.394 |
|
1995 |
Kim Sr, McKee TA, McMorris FR, Roberts FS. p-competition graphs Linear Algebra and Its Applications. 217: 167-178. DOI: 10.1016/0024-3795(94)00060-Q |
0.367 |
|
1993 |
Roberts FS. New Directions in Graph Theory (With an Emphasis on the Role of Applications) Annals of Discrete Mathematics. 55: 13-43. DOI: 10.1016/S0167-5060(08)70373-X |
0.386 |
|
1993 |
Roberts FS. No-hole 2-distant colorings Mathematical and Computer Modelling. 17: 139-144. DOI: 10.1016/0895-7177(93)90265-Z |
0.357 |
|
1993 |
Kim Sr, McKee TA, McMorris FR, Roberts FS. p-competition numbers Discrete Applied Mathematics. 46: 87-92. DOI: 10.1016/0166-218X(93)90160-P |
0.338 |
|
1992 |
Isaak G, Kim S, McKees TA, McMorris FR, Roberts FS. 2-Competition Graphs Siam Journal On Discrete Mathematics. 5: 524-538. DOI: 10.1137/0405042 |
0.376 |
|
1992 |
Roberts FS, Xu Y. On the optimal strongly connected orientations of city street graphs. III. Three east–west avenues or north–south streets Networks. 22: 109-143. DOI: 10.1002/Net.3230220202 |
0.336 |
|
1991 |
Hefner KAS, Jones KF, Kim Sr, Lundgren JR, Roberts FS. (i, j) competition graphs Discrete Applied Mathematics. 32: 241-262. DOI: 10.1016/0166-218X(91)90002-E |
0.385 |
|
1989 |
Cozzens MB, Roberts FS. On dimensional properties of graphs Graphs and Combinatorics. 5: 29-46. DOI: 10.1007/Bf01788656 |
0.363 |
|
1988 |
Roberts FS, Xu Y. On the Optimal Strongly Connected Orientations of City Street Graphs I: Large Grids Siam Journal On Discrete Mathematics. 1: 199-222. DOI: 10.1137/0401022 |
0.363 |
|
1985 |
Roberts FS. Applications of the theory of meaningfulness to psychology Journal of Mathematical Psychology. 29: 311-332. DOI: 10.1016/0022-2496(85)90011-2 |
0.301 |
|
1984 |
Roberts FS. Applications of the Theory of Meaningfulness to order and Matching Experiments Advances in Psychology. 20: 283-292. DOI: 10.1016/S0166-4115(08)62093-2 |
0.34 |
|
1983 |
Roberts FS, Steif JE. A characterization of competition graphs of arbitrary digraphs Discrete Applied Mathematics. 6: 323-326. DOI: 10.1016/0166-218X(83)90087-2 |
0.397 |
|
1983 |
Cozzens MB, Roberts FS. Computing the boxicity of a graph by covering its complement by cointerval graphs Discrete Applied Mathematics. 6: 217-228. DOI: 10.1016/0166-218X(83)90077-X |
0.395 |
|
1983 |
Opsut RJ, Roberts FS. I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications Networks. 13: 327-345. DOI: 10.1002/Net.3230130302 |
0.37 |
|
1983 |
Opsut RJ, Roberts FS. OptimalI-Intersection assignments for graphs: A linear programming approach Networks. 13: 317-326. DOI: 10.1002/Net.3230130301 |
0.368 |
|
1982 |
Cozzens MB, Roberts FS. Double Semiorders and Double Indifference Graphs Siam Journal On Algebraic Discrete Methods. 3: 566-583. DOI: 10.1137/0603058 |
0.351 |
|
1982 |
Hell P, Roberts FS. Analogues of the Shannon Capacity of a Graph North-Holland Mathematics Studies. 60: 155-168. DOI: 10.1016/S0304-0208(08)73501-1 |
0.372 |
|
1980 |
Roberts FS. On Luce's Theory of Meaningfulness Philosophy of Science. 47: 424-433. DOI: 10.1086/288945 |
0.316 |
|
1979 |
Roberts FS. ON THE MOBILE RADIO FREQUENCY ASSIGNMENT PROBLEM AND THE TRAFFIC LIGHT PHASING PROBLEM Annals of the New York Academy of Sciences. 319: 466-483. DOI: 10.1111/J.1749-6632.1979.Tb32824.X |
0.331 |
|
1979 |
Roberts FS. Structural modeling and measurement theory Technological Forecasting and Social Change. 14: 353-365. DOI: 10.1016/0040-1625(79)90034-9 |
0.307 |
|
1972 |
Roberts FS. What if utility functions do not exist? Theory and Decision. 3: 126-139. DOI: 10.1007/Bf00141052 |
0.326 |
|
1971 |
Roberts FS. Signed Digraphs and the Growing Demand for Energy Environment and Planning a: Economy and Space. 3: 395-410. DOI: 10.1068/A030395 |
0.319 |
|
1971 |
Roberts FS, Spencer JH. A characterization of clique graphs Journal of Combinatorial Theory, Series B. 10: 102-108. DOI: 10.1016/0095-8956(71)90070-0 |
0.391 |
|
1971 |
Roberts FS. On the compatibility between a graph and a simple order Journal of Combinatorial Theory, Series B. 11: 28-38. DOI: 10.1016/0095-8956(71)90010-4 |
0.389 |
|
Show low-probability matches. |