On extensions, linear extensions, upsets and downsets of ordered sets
From MaRDI portal
Publication:556831
DOI10.1016/j.disc.2004.12.007zbMath1079.06004MaRDI QIDQ556831
Ricardo C. Corrêa, Jayme Luiz Szwarcfiter
Publication date: 23 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.007
06A07: Combinatorics of partially ordered sets
Cites Work
- Unnamed Item
- Unnamed Item
- Generating all the acyclic orientations of an undirected graph
- An algorithm to generate the ideals of a partial order
- Interval reductions and extensions of orders: Bijections to chains in lattices
- A structured program to generate all topological sorting arrangements
- Extending a partially ordered set: Links with its lattice of ideals
- An algorithm to generate all topological sorting arrangements
- Generating Linear Extensions Fast
- Generating the Acyclic Orientations of a Graph
- On the generation of all topological sortings