Advertisement

Order

, Volume 6, Issue 2, pp 119–132 | Cite as

Diagrams, orientations, and varieties

  • Hans-Jürgen Bandelt
  • Ivan Rival
Article
  • 21 Downloads

Abstract

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called ‘inversion’, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations.

Key words

Covering graph diagram retract product orientation inversion variety alternating cover cycle cycle 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.-J. Bandelt (1984a) Discrete ordered sets whose covering graphs are median,Proc. Amer. Math. Soc. 91, 6–8.Google Scholar
  2. H.-J. Bandelt (1984b) Retracts of hypercubes,J. Graph Theory 8, 501–510.Google Scholar
  3. D. Duffus and I. Rival (1981) A structure theory for ordered sets,Discrete Math. 35, 53–118.CrossRefGoogle Scholar
  4. D. Duffus and I. Rival (1983) Graphs orientable as distributive lattices,Proc. Amer. Math. Soc. 88, 197–200.Google Scholar
  5. R. Jégou, R. Nowakowski and I. Rival87 The diagram invariant problem for planar lattices,Acta Sci. Math. (Szeged)51, 103–121.Google Scholar
  6. D. Kelly (1985) Comparability graphs, inGraphs and Order (I. Rival, ed.), D. Reidel, Dordrecht, pp. 3–40.Google Scholar
  7. W. P. Liu and I. Rival (1990) Inversions, cuts and orientations,Discrete Math. (to appear).Google Scholar
  8. G. J. Minty (1963) A theorem onn-coloring the points of a linear graph,Amer. Math. Monthly 69, 623–624.Google Scholar
  9. G. J. Minty (1967) A theorem on three-colouring the edges of a trivalent graph,J. Combin. Theory 2, 164–167.Google Scholar
  10. K. M. Mosesjan (1972a) On strongly basable graphs (in Russian),Dokl. Akad. Nauk. Armjan. SSR.54, 134–138.Google Scholar
  11. K. M. Mosesjan (1972b) Some theorems on strongly basable graphs (in Russian),Dokl. Akad. Nauk Armjan. SSR.54, 241–245.Google Scholar
  12. K. M. Mosesjan (1972c) Basable and strongly basable graphs (in Russian),Dokl. Akad. Nauk. Armjan. SSR. 55, 83–86.Google Scholar
  13. H. M. Mulder (1980) The interval function of a graph, Math Centre Tracts 132, Amsterdam.Google Scholar
  14. J. Nešetřil and V. Rödl (1987) The complexity of diagrams,Order 3, 321–300.CrossRefGoogle Scholar
  15. A. Pele and I. Rival (1990) Orders with level diagrams,European J. Combin. (to appear).Google Scholar
  16. M. Pouzet and I. Rival (1988) Is there a diagram invariant?Discrete Math. 73, 181–188.CrossRefGoogle Scholar
  17. O. Pretzel (1985) On graphs that can be oriented as diagrams of ordered sets,Order 2, 25–40.CrossRefGoogle Scholar
  18. O. Pretzel (1986a) On reorienting graphs by pushing down maximal vertices,Order 3, 135–153.Google Scholar
  19. O. Pretzel (1986b) Orientations and reorientations of graphs, inCombinatories and Ordered Sets (I. Rival, ed.),Contemp. Math. 57, 103–125.Google Scholar
  20. I. Rival (1984) Linear extensions of finite ordered sets,Ann. Discrete Math. 23, 355–370.Google Scholar
  21. I. Rival (1985a) The diagram, inGraphs and Order (I. Rival, ed.), D. Reidel, Dordrecht, pp. 103–133.Google Scholar
  22. I. Rival (1985b) The diagram,Order 2, 101–104.CrossRefGoogle Scholar
  23. I. Rival and N. Zaguia (1985) Antichain cutsets,Order 1, 235–247.CrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 1989

Authors and Affiliations

  • Hans-Jürgen Bandelt
    • 1
  • Ivan Rival
    • 2
  1. 1.Department of MathematicsUniversity of MaastrichtMaastrichtThe Netherlands
  2. 2.Department of Computer ScienceUniversity of OttawaOttawaCanada

Personalised recommendations