Article PDF
Research Articles
Alzohairi, M., Rival, I. and Kostochka, A.: The pagenumber of spherical lattices is unbounded, Arab J. Math. Sci. 7(1) (2001), 79–82.
Lee, J. G., Liu, W.-P., Nowakowski, R. and Rival, I.: Dimension invariance of subdivisions, Bull. Austral. Math. Soc. 63(1) (2001), 141–150.
Hashemi, S. M., Rival, I. and Kisielewicz, A.: The complexity of upward drawings on spheres, Order 14(4) (1997/98), 327–363.
Grätzer, G., Rival, I. and Zaguia, N.: A correction to: “Small representations of finite distributive lattices as congruence lattices,” Proc. Amer. Math. Soc. 126(8) (1998), 2509–2510.
Ewacha, K., Rival, I. and Zaguia, N.: Unimodality, linear extensions and width two orders, Discrete Math. (1997).
Ewacha, K., Rival, I. and Zaguia, N.: Approximating the number of linear extensions, in Orders, Algorithms and Applications (Lyon, 1994), Theoret. Comput. Sci. 175(2) (1997), 282
Fofanova, T., Rival, I. and Rutkowski, A.: Dimension two, fixed points and dismantlable ordered sets, Order 13(3) (1996), 245–253.
Hashemi, S. M., Kisielewicz, A. and Rival, I.: Upward drawings on planes and spheres (extended abstract), in Graph Drawing (Passau, 1995), Lecture Notes in Comput. Sci. 1027, Springer, Berlin, 1996, pp. 277–286.
Alzohairi, M. and Rival, I.: Series-parallel planar ordered sets have pagenumber two, Graph Drawing' 96, September 18–20, 1996, Berkeley, California.
Rival, I.: Order, ice and surfaces, in Lattice Theory and its Applications (Darmstadt, 1991), Res. Exp. Math. 23, Heldermann, Lemgo, 1995, pp. 211–218.
Pouzet, M., Reuter, K., Rival, I. and Zaguia, N.: A generalized permutahedron, Algebra Universalis 34(4) (1995), 496–509.
Liu, W.-P., Rival, I. and Zaguia, N.: Automorphisms, isotone self-maps and cycle-free orders, in Combinatorics of Ordered Sets (Oberwolfach, 1991), Discrete Math. 144(1–3) (1995), 59–66.
Grant, K., Nowakowski, R. J. and Rival, I.: The endomorphism spectrum of an ordered set, Order 12(1) (1995), 45–55.
Rival, I. and Zaguia, N.: Perpendicular orders, Discrete Math. 137(1–3) (1995), 303–313.
Rival, I. and Zaguia, N.: Images of simple lattice polynomials, Algebra Universalis 33(1) (1995), 10–14.
Rival, I. and Rutkowski, A.: Does almost every isotone, self-map have a fixed point?, in Extremal Problems for Finite Sets (Visegrd, 1991), Bolyai Soc. Math. Stud. 3, János Bolyai Math. Soc., Budapest, 1994, pp. 413–422.
Jourdan, G.-V., Rival, I. and Zaguia, N.: Conjectures and constructions about perpendiculars pairs – by experiment, International Conference Formal Power Series and Algebraic Combinatorics' 95, Marne-la-Vallée, France, June 1995.
Jourdan, G.-V., Rival, I. and Zaguia, N.: Order explorer, a system to see and do in four dimensions, International Conference on Ordinal and Symbolic Data Analysis' 95, Paris, France, June 1995.
Grätzer, G., Rival, I. and Zaguia, N.: Small representations of finite distributive lattices as congruence lattices, Proc. Amer. Math. Soc. 123(7) (1995), 1959–1961.
Hashemi, S. M. and Rival, I.: Upward drawings to fit surfaces, in Orders, Algorithms, and Applications (Lyon, 1994), Lecture Notes in Comput. Sci. 831, Springer, Berlin, 1994, pp. 53–58.
Jourdan, G.-V., Rival, I. and Zaguia, N.: Upward drawing on the plane grid using less ink, Graph Drawing' 94, Princeton, October 1994.
Fon-Der-Flaass, D. and Rival, I.: Collecting information in graded ordered sets, Parallel Process. Lett. 3(3) (1993), 253–260.
Kisielewicz, A. and Rival, I.: Every triangle-free planar graph has a planar upward drawing, Order 10(1) (1993), 1–16.
Rival, I.: Reading, drawing, and order, in Algebras and Orders (Montreal, PQ, 1991), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 389, Kluwer Acad. Publ., Dordrecht, 1993, pp. 359–404.
Rival, I.: Order, invariance and visibility, in Words, Languages and Combinatorics (Kyoto, 1990), World Sci. Publishing, River Edge, NJ, 1992, pp. 444–453.
Rival, I. and Urrutia, J.: Representing orders by moving figures in space, in Algebraic Graph Theory (Leibnitz, 1989), Discrete Math. 109(1–3) (1992), 255–263.
Nowakowski, R., Rival, I. and Urrutia, J.: Lattices contained in planar orders are planar, Algebra Universalis 29(4) (1992), 580–588.
Rival, I. and Stanford, M.: Algebraic aspects of partition lattices, in Matroid Applications, Encyclopedia Math. Appl. 40, Cambridge Univ. Press, Cambridge, 1992, pp. 106–122.
Foldes, S., Rival, I. and Urrutia, J.: Light sources, obstructions and spherical orders, Discrete Math. 102(1) (1992), 13–23.
Rival, I.: Order aspects of ice flow, in E. Boros and P. L. Hammer (eds), Workshop Combin. Optimiz. Sci. Tech., Rutgers, 1991, pp. 286–289.
Rival, I.: Problems about planar orders, in Finite and Infinite Combinatorics in Sets and Logic (Banff, AB, 1991), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 411, Kluwer Acad. Publ., Dordrecht, 1991, pp. 337–347.
Ewacha, K., Li,W. X. and Rival, I.: Order, genus, and diagram invariance, Order 8(2) (1991), 107–113.
Liu, W.-P. and Rival, I.: Enumerating orientations of ordered sets, in Combinatorics of Ordered Sets (Oberwolfach, 1988), Discrete Math. 88(2–3) (1991), 239–247.
Czyzowicz, J., Rival, I. and Urrutia, J.: Galleries and light matchings: Fat cooperative guards, in Vision Geometry (Hoboken, NJ, 1989), Contemp. Math. 119, Amer. Math. Soc., Providence, RI, 1991, pp. 21–28.
Al-Thukair, F., Pelc, A., Rival, I. and Urrutia, J.: Motion planning, two-directional point representations, and ordered sets, SIAM J. Discrete Math. 4(2) (1991), 151–163.
Reuter, K. and Rival, I.: Genus of orders and lattices, in Graph-Theoretic Concepts in Computer Science (Berlin, 1990), Lecture Notes in Comput. Sci. 484, Springer, Berlin, 1991, pp. 260–275.
Pelc, A. and Rival, I.: Orders with level diagrams, European J. Combin. 12(1) (1991), 61–68. 92c:06003.
Liu, W.-P. and Rival, I.: Inversions, cuts, and orientations, Discrete Math. 87(2) (1991), 163–174.
Rival, I.: Dilworth's covering theorem for modular lattices, in The Dilworth Theorems, Contemp. Math., Birkhäuser, Boston, MA, 1990, pp. 261–264.
Ewacha, K., Rival, I. and Steiner, G.: Permutation schedules for flow shops with precedence constraints, Oper. Res. 38(6) (1990), 1135–1139.
Czyzowicz, J., Pelc, A. and Rival, I.: Planar ordered sets of width two, Math. Slovaca 40(4) (1990), 375–388.
Czyzowicz, J., Pelc, A., Rival, I. and Urrutia, J.: Crooked diagrams with few slopes, Order 7(2) (1990), 133–143.
Quackenbush, R. W., Rival, I. and Rosenberg, I. G.: Clones, order varieties, near unanimity functions and holes, Order 7(3) (1990), 239–247.
Czyzowicz, J., Pelc, A. and Rival, I.: Unfolding weighted consensus orders into consistent numerical scales, in Topics in Combinatorics and Graph Theory (Oberwolfach, 1990), Physica, Heidelberg, 1990, pp. 207–217.
Czyzowicz, J., Pelc, A. and Rival, I.: Drawing orders with few slopes, Discrete Math. 82(3) (1990), 233–250.
Di Battista, G., Liu, W.-P. and Rival, I.: Bipartite graphs, upward drawings, and planarity, Inform. Process. Lett. 36(6) (1990), 317–322.
Nowakowski, R., Rival, I. and Urrutia, J.: Representing orders on the plane by translating points and lines, in Computational Algorithms, Operations Research and Computer Science (Burnaby, BC, 1987), Discrete Appl. Math. 27(1–2) (1990), 147–156.
Czyzowicz, J., Rival, I. and Urrutia, J.: Galleries, light matchings and visibility graphs, in Algorithms and Data Structures (Ottawa, ON, 1989), Lecture Notes in Comput. Sci. 382, Springer, Berlin, 1989, pp. 316–324.
Rival, I.: Graphical data structures for ordered sets, in Algorithms and Order (Ottawa, ON, 1987), Kluwer Acad. Publ., Dordrecht, 1989, pp. 3–31.
Bandelt, H.-J. and Rival, I.: Diagrams, orientations, and varieties, Order 6(2) (1989), 119–132.
Pouzet, M. and Rival, I.: Is there a diagram invariant?, in Proceedings of the Oberwolfach Meeting “Kombinatorik” (1986), Discrete Math. 73(1–2) (1989), 181–188.
Rival, I. and Urrutia, J.: Representing orders on the plane by translating convex figures, Order 4(4) (1988), 319–339.
Nowakowski, R. and Rival, I.: Retract rigid Cartesian products of graphs, Discrete Math. 70(2) (1988), 169–184.
Rival, I. and Zaguia, N.: Greedy linear extensions with constraints, in Special Issue: Ordered Sets (Oberwolfach, 1985), Discrete Math. 63(2–3) (1987), 249–260.
Jégou, R., Nowakowski, R. and Rival, I.: The diagram invariant problem for planar lattices, Acta Sci. Math. (Szeged) 51(1–2) (1987), 103–121.
Hell, P. and Rival, I.: Absolute retracts and varieties of reflexive graphs, Canad. J. Math. 39(3) (1987), 544–567.
Rival, I. and Zaguia, N.: Effective constructions of cutsets for finite and infinite ordered sets, Acta Sci. Math. (Szeged) 51(1–2) (1987), 191–207.
Lonc, Z. and Rival, I.: Chains, antichains, and fibres, J. Combin. Theory Ser. A 44(2) (1987), 207–228.
Jawhari, El M., Pouzet, M. and Rival, I.: A classification of reflexive graphs: The use of “holes”, Canad. J. Math. 38(6) (1986), 1299–1328.
Rival, I. and Zaguia, N.: Constructing N-free, jump-critical ordered sets, in Proceedings of the Seventeenth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL,1986), Congr. Numer. 55 (1986), 199–204.
Reuter, K. and Rival, I.: Subdiagrams equal in number to their duals, Algebra Universalis 23(1) (1986), 70–76.
Rival, I. and Zaguia, N.: Constructing greedy linear extensions by interchanging chains, Order 3(2) (1986), 107–121.
Ginsburg, J., Rival, I. and Sands, B.: Antichains and finite sets that meet all maximal chains, Canad. J. Math. 38(3) (1986), 619-632.
Rival, I.: Stories about order and the letter N (en), in Combinatorics and Ordered Sets (Arcata, CA, 1985), Contemp. Math. 57, Amer. Math. Soc., Providence, RI, 1986, pp. 263–285.
Bandelt, H.-J. and Rival, I.: Classifying graphs by intersecting disks, J. Combin. Inform. System Sci. 10(1–2) (1985), 41–51.
Nevermann, P. and Rival, I.: Holes in ordered sets, Graphs Combin. 1(4) (1985), 339–350.
Rival, I.: Some order-theoretical ideas about scheduling, in IX Symposium on Operations Research. Part I. Sections 1–4 (Osnabrck, 1984), Methods Oper. Res. 49, Athenäum/Hain/Hanstein, Königstein, 1985, pp. 419–430. 90B35.
El-Zahar, M. H. and Rival, I.: Greedy linear extensions to minimize jumps, Discrete Appl. Math. 11(2) (1985), 143–156. (Reviewer: H. T. Lau).
Rival, I.: The diagram, in Graphs and Order (Banff, Alta., 1984), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 147, Reidel, Dordrecht, 1985, pp. 103–133.
El-Zahar, M. H. and Rival, I.: Examples of jump-critical ordered sets, SIAM J. Algebraic Discrete Methods 6(4) (1985), 713–720.
Rival, I. and Zaguia, N.: Antichain cutsets, Order 1(3) (1985), 235–247.
Rival, I.: Linear extensions of finite ordered sets, in Orders: Description and Roles (L'Arbresle, 1982), North-Holland Math. Stud. 99, North-Holland, Amsterdam, 1984, pp. 355–370.
Pouzet, M. and Rival, I.: Every countable lattice is a retract of a direct product of chains, Algebra Universalis 18(3) (1984), 295–307.
Pouzet, M. and Rival, I.: Quotients of complete ordered sets, Algebra Universalis 17(3) (1983), 393–405.
Rival, I.: Optimal linear extensions by interchanging chains, Proc. Amer. Math. Soc. 89(3) (1983), 387–394.
Nowakowski, R. and Rival, I.: The smallest graph variety containing all paths, Discrete Math. 43(2–3) (1983), 223–234.
Nowakowski, R. and Rival, I.: On a class of isometric subgraphs of a graph, Combinatorica 2(1) (1982), 79–90.
Duffus, D. and Rival, I.: Graphs orientable as distributive lattices, Proc. Amer. Math. Soc. 88(2) (1983), 197–200.
Rival, I. and Sands, B.: Pictures in lattice theory, in Algebraic and Geometric Combinatorics, North-Holland Math. Stud. 65, North-Holland, Amsterdam, 1982, pp. 341–355.
Rival, I. and Sands, B.: How many four-generated simple lattices?, in Universal Algebra and Applications (Warsaw, 1978), Banach Center Publ. 9, PWN, Warsaw, 1982, pp. 67–72.
Galvin, F., Rival, I. and Sands, B.: A Ramsey-type theorem for traceable graphs, J. Combin. Theory Ser. B 33(1) (1982), 7–16.
Rival, I.: The retract construction, in Ordered Sets (Banff, Alta., 1981), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 83, Reidel, Dordrecht–Boston, MA, 1982, pp. 97–122.
Davey, B. A. and Rival, I.: Exponents of lattice-ordered algebras, Algebra Universalis 14(1) (1982), 87–98.
Duffus, D., Rival, I. and Winkler, P.: Minimizing setups for cycle-free ordered sets, Proc. Amer. Math. Soc. 85(4) (1982), 509–513.
Pouzet, M. and Rival, I.: Which ordered sets have a complete linear extension? Canad. J. Math. 33(5) (1981), 1245–1254.
Rival, I., Ruckelshausen, W. and Sands, B.: On the ubiquity of herringbones in finitely generated lattices, Proc. Amer. Math. Soc. 82(3) (1981), 335–340.
Rival, I. and Wille, R.: The smallest order variety containing all chains, Discrete Math. 35 (1981), 203–212.
Duffus, D., Pouzet, M. and Rival, I.: Complete ordered sets with no infinite antichains, Discrete Math. 35 (1981), 39–52.
Duffus, D. and Rival, I.: A structure theory for ordered sets, DiscreteMath. 35 (1981), 53–118.
Rival, I.: The problem of fixed points in ordered sets, in Combinatorics 79 (Proc. Colloq., Univ. Montréal, Montreal, Que., 1979), Part I, Ann. Discrete Math. 8 (1980), 283–292.
Duffus, D., Rival, I. and Simonovits, M.: Spanning retracts of a partially ordered set, Discrete Math. 32(1) (1980), 1–7.
Bisztriczky, T. and Rival, I.: Continuous, slope-preserving maps of simple closed curves, Canad. J. Math. 32(5) (1980), 1102–1113.
Rival, I. and Sands, B.: On the adjacency of vertices to the vertices of an infinite subgraph, J. London Math. Soc. (2) 21(3) (1980), 393–400.
Duffus, D., Poguntke,W. and Rival, I.: Retracts and the fixed point problem for finite partially ordered sets, Canad. Math. Bull. 23(2) (1980), 231–236.
Björner, A. and Rival, I.: A note on fixed points in semimodular lattices, Discrete Math. 29(3) (1980), 245–250.
Duffus, D. and Rival, I.: A note on weak embeddings of distributive lattices, Algebra Universalis 10(2) (1980), 258–259.
Jónsson, B. and Rival, I.: Lattice varieties covering the smallest nonmodular variety, Pacific J. Math. 82(2) (1979), 463–478.
Bollobás, B. and Rival, I.: The maximal size of the covering graph of a lattice, Algebra Universalis 9(3) (1979), 371–373.
Rival, I. and Sands, B.: Planar sublattices of a free lattice. II, Canad. J. Math. 31(1) (1979), 17–34.
Rival, I. and Wille, R.: Lattices freely generated by partially ordered sets: Which can be “drawn”? J. Reine Angew. Math. 310 (1979), 56–80.
Duffus, D. and Rival, I.: Retracts of partially ordered sets, J. Austral. Math. Soc. Ser. A 27(4) (1979), 495–506.
Nowakowski, R. and Rival, I.: Fixed-edge theorem for graphs with loops, J. Graph Theory 3(4) (1979), 339–350.
Rabinovitch, I. and Rival, I.: The rank of a distributive lattice, Discrete Math. 25(3) (1979), 275–279.
Duffus, D. and Rival, I.: Separable subsets of a finite lattice, J. Combin. Theory Ser. A 25(2) (1978), 188–192.
Rival, I. and Sands, B.: Planar sublattices of a free lattice. I, Canad. J. Math. 30(6) (1978), 1256–1283.
Nowakowski, R. and Rival, I.: Distributive cover-preserving sublattices of modular lattices, Nanta Math. 11(2) (1978), 110–123.
Rival, I. and Sands, B.: A note on the congruence lattice of a finitely generated algebra, Proc. Amer. Math. Soc. 72(3) (1978), 451–455.
Duffus, D. and Rival, I.: Crowns in dismantlable partially ordered sets, in Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, Colloq. Math. Soc. János Bolyai 18, North-Holland, Amsterdam, 1978, pp. 271–292.
Duffus, D. and Rival, I.: A logarithmic property for exponents of partially ordered sets, Canad. J. Math. 30(4) (1978), 797–807.
Gaskill, H. S. and Rival, I.: An exchange property for modular lattices, Algebra Universalis 8(3) (1978), 354–356.
Duffus, D., Jónsson, B. and Rival, I.: Structure results for function lattices, Canad. J. Math. 30(2) (1978), 392–400.
Davey, B. A., Duffus, D., Quackenbush, R. W. and Rival, I.: Exponents of finite simple lattices. J. London Math. Soc. (2) 17(2) (1978), 203–221.
Duffus, D. and Rival, I.: Path length in the covering graph of a lattice, Discrete Math. 19(2) (1977), 139–158.
Poguntke, W. and Rival, I.: A theorem on finite sublattices of free lattices, in Contributions to Universal Algebra (Colloq., József Attila Univ., Szeged, 1975), Colloq. Math. Soc. János Bolyai 17, North-Holland, Amsterdam, 1977, pp. 357–361.
Nowakowski, R. and Rival, I.: The spectrum of a finite lattice: Breadth and length techniques, Canad. Math. Bull. 20(3) (1977), 319–329.
Jónsson, B. and Rival, I.: Critical edges in subdirectly irreducible lattices, Proc. Amer. Math. Soc. 66(2) (1977), 194–196.
Rival, I.: Combinatorial inequalities for semimodular lattices of breadth two, Algebra Universalis 6(3) (1976), 303–311.
Rival, I.: A note on linear extensions of irreducible elements in a finite lattice, Algebra Universalis 6(2) (1976), 99–103.
Rival, I.: A fixed point theorem for finite partially ordered sets, J. Combin. Theory Ser. A 21(3) (1976), 309–318.
Poguntke, W. and Rival, I.: Finite four-generated simple lattices contain all finite lattices, Proc. Amer. Math. Soc. 55(1) (1976), 22–24.
Davey, B. A. and Rival, I.: Finite sublattices of three-generated lattices, J. Austral. Math. Soc. Ser. A 21(2) (1976), 171–178.
Ganter, B. and Rival, I.: An arithmetical theorem for modular lattices, Algebra Universalis 5(3) (1975), 395–396.
Davey, B. A., Poguntke, W. and Rival, I.: A characterization of semi-distributivity, Algebra Universalis 5 (1975), 72–75.
Rival, I.: Sublattices of modular lattices of finite length, Canad. Math. Bull. 18(1) (1975), 95–98.
Kelly, D. and Rival, I.: Planar lattices, Canad. J. Math. 27(3) (1975), 636–665.
Rival, I. and Sands, B.:Weak embeddings and embeddings of finite distributive lattices, Arch. Math. (Basel) 26(4) (1975), 346–352.
Kelly, D. and Rival, I.: Certain partially ordered sets of dimension three, J. Combin. Theory Ser. A 18 (1975), 239–242.
Kelly, D. and Rival, I.: Crowns, fences, and dismantlable lattices, Canad. J. Math. 26 (1974), 1257–1271.
Poguntke, W. and Rival, I.: Finite sublattices generated by order-isomorphic subsets, Arch. Math. (Basel) 25 (1974), 225–230.
Rival, I.: Maximal sublattices of finite distributive lattices. II, Proc. Amer. Math. Soc. 44 (1974), 263–268.
Rival, I.: Lattices with doubly irreducible elements, Canad. Math. Bull. 17 (1974), 91–95.
Antonius, R. and Rival, I.: A note onWhitman's property for free lattices, Algebra Universalis 4 (1974), 271–272.
Ganter, B. and Rival, I.: Dilworth's covering theorem for modular lattices: A simple proof, Algebra Universalis 3 (1973), 348–350.
Rival, I.: Maximal sublattices of finite distributive lattices, Proc. Amer. Math. Soc. 37 (1973), 417–420.
Rival, I.: Projective images of modular (distributive, complemented) lattices are modular (distributive, complemented), Algebra Universalis 2 (1972), 395.
Rights and permissions
About this article
Cite this article
Duffus, D. Obituary: Ivan Rival. Order 20, 173–183 (2003). https://doi.org/10.1023/B:ORDE.0000026602.94442.32
Issue Date:
DOI: https://doi.org/10.1023/B:ORDE.0000026602.94442.32