Inversions, cuts, and orientations
From MaRDI portal
Publication:2640623
DOI10.1016/0012-365X(91)90045-4zbMath0721.06001MaRDI QIDQ2640623
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
diagram; complexity; enumeration; inversion; pushdown; orientation of covering graph; reorientation of an ordered set
06A06: Partial orders, general
06A07: Combinatorics of partially ordered sets
05C20: Directed graphs (digraphs), tournaments
Related Items
Enumerating orientations of ordered sets, On reorienting graphs by pushing down maximal vertices. II, Obituary: Ivan Rival, Orientations of chain groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Antichain cutsets
- Diagrams, orientations, and varieties
- On graphs that can be oriented as diagrams of ordered sets
- On reorienting graphs by pushing down maximal vertices
- Is there a diagram invariant?
- Path length in the covering graph of a lattice
- Complexity of diagrams
- Retracts of hypercubes
- Graphs Orientable as Distributive Lattices
- Planar Lattices