Generating linear extensions of posets by transpositions. Ruskey, F. Journal of Combinatorial Theory, Series B, 54(1):77--101, January, 1992.
Generating linear extensions of posets by transpositions [link]Paper  doi  abstract   bibtex   
This paper considers the problem of listing all linear extensions of a partial order so that successive extensions differ by the transposition of a single pair of elements. A necessary condition is given for the case when the partial order is a forest. A necessary and sufficient condition is given for the case where the partial order consists of disjoint chains. Some open problems are mentioned.
@article{ Ruskey1992a,
  abstract = {This paper considers the problem of listing all linear extensions of a partial order so that successive extensions differ by the transposition of a single pair of elements. A necessary condition is given for the case when the partial order is a forest. A necessary and sufficient condition is given for the case where the partial order consists of disjoint chains. Some open problems are mentioned.},
  author = {Ruskey, Frank},
  doi = {10.1016/0095-8956(92)90067-8},
  file = {:Users/KunihiroWASA/Dropbox/paper/1992/Ruskey, Generating linear extensions of posets by transpositions, 1992.pdf:pdf},
  issn = {00958956},
  journal = {Journal of Combinatorial Theory, Series B},
  month = {January},
  number = {1},
  pages = {77--101},
  title = {{Generating linear extensions of posets by transpositions}},
  url = {http://www.sciencedirect.com/science/article/pii/0095895692900678 http://linkinghub.elsevier.com/retrieve/pii/0095895692900678},
  volume = {54},
  year = {1992}
}

Downloads: 0