The graph of linear extensions revisited

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 354-369

  Naatz, Michael ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Connectivity; Cycle space; Embedding; Hamilton path; Isometric subgraph; Jump number; Linear extension; Poset; Transposition

Indexed keywords

EID: 0012913018     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199352609     Document Type: Article

References (19)

1. A. BJÖRNER AND M. L. WACHS, Permutation statistics and linear extensions of posets, J. Combin. Theory Ser. A, 58 (1991), pp. 85-114.
2. M. M. DEZA AND M. LAURENT, Geometry of Cuts and Metrics, Springer-Verlag, Berlin, Heidelberg, New York, 1997.
3. R. DIESTEL, Graph Theory, Springer-Verlag, Berlin, Heidelberg, New York, 1997.
4. S. FELSNER AND K. REUTER, The linear-extension-diameter of a poset, SIAM J. Discrete Math., 12 (1999), pp. 360-373.
5. H. FLEISCHNER, On spanning subgraphs of a connected bridgeless graph and their applications, J. Combin. Theory Ser. B, 16 (1974), pp. 17-28.
6. H. FLEISCHNER, The square of every two-connected graph is hamiltonian, J. Combin. Theory Ser. B, 16 (1974), pp. 29-34.
7. X. LI, The connectivity of path graphs, in Combinatorics, Graph Theory and Algorithms, Y. Alavi, D. R. Lick, and J. Liu, eds., World Scientific, River Edge, NJ, 1994, pp. 187-192.
8. R. H. MÖHRING, Computationally tractable classes of ordered sets, in Algorithms and Order, I. Rival, ed., NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 255, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1989.
9. M. NAATZ, Der Graph der linearen Erweiterungen einer geordneten Menge, diploma thesis, Mathematisches Seminar der Universität Hamburg, Germany, 1998.
10. G. PRUESSE AND F. RUSKEY, Generating the linear extensions of certain posets by transpositions, SIAM J. Discrete Math., 4 (1991), pp. 413-422.
11. G. PRUESSE AND F. RUSKEY, Generating linear extensions fast, SIAM J. Comput., 23 (1994), pp. 373-386.
12. K. REUTER, The comparability graph and the graph of linear extensions of a poset, Preprint Hamburger Beiträge zur Mathematik, Heft 57 (1996).
13. K. REUTER, Linear extensions of a poset as abstract convex sets, Preprint Hamburger Beitrage zur Mathematik, Heft 56 (1996).
14. S. ŘIHA, A new proof of the theorem by Fleischner, J. Combin. Theory Ser. B, 52 (1991), pp. 117-123.
15. n, SIAM J. Discrete Math., 6 (1993), pp. 152-166.
16. C. D. SAVAGE AND C.-Q. ZHANG, A note on the connectivity of acyclic orientation graphs, Discrete Math., 184 (1998), pp. 281-287.
17. G. STACHOWIAK, Hamilton paths m graphs of linear extensions for unions of posets, SIAM J Discrete Math., 5 (1992), pp. 199-206.
18. W. T. TROTTER, Combinatorics and Partially Ordered Sets: Dimension Theory, Johns Hopkins Series in the Mathematical Sciences, The Johns Hopkins University Press, Baltimore, 1992.
19. D. B. WEST, Generating linear extensions by adjacent transpositions, J. Combin. Theory Ser. B, 58 (1993), pp 58-64.