Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
From MaRDI portal
Publication:6170445
DOI10.1137/23m1546567zbMath1519.05141arXiv2212.03915MaRDI QIDQ6170445
Hung P. Hoang, Torsten Mütze, Arturo I. Merino, Ondřej Mička, Jean Cardinal
Publication date: 10 August 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.03915
(n)-dimensional polytopes (52B11) Hypergraphs (05C65) Permutations, words, matrices (05A05) Lattice ideals, congruence relations (06B10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating all the acyclic orientations of an undirected graph
- Graphs and cubes
- Binary bubble languages and cool-lex order
- The Hopf algebra of diagonal rectangulations.
- Graph properties of graph associahedra
- Faces of generalized permutohedra
- A realization of graph associahedra
- Characterizations of strongly chordal graphs
- The connectivity of acyclic orientation graphs
- A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
- Efficient enumeration of graph orientations with sources
- Wonderful models of subspace arrangements
- Combinatorial generation via permutation languages. II. Lattice congruences
- Pruned inside-out polytopes, combinatorial reciprocity theorems and generalized permutahedra
- Incidence matrices and interval graphs
- The diameter of associahedra
- Coxeter complexes and graph-associahedra
- Shard polytopes
- The Greedy Gray Code Algorithm
- Lattice Theory of the Poset of Regions
- Finite Coxeter Groups and the Weak Order
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Permutohedra, Associahedra, and Beyond
- Hard Enumeration Problems in Geometry and Combinatorics
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Algorithmic Aspects of Vertex Elimination on Graphs
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- From the Tamari Lattice to Cambrian Lattices and Beyond
- Quotientopes
- A class of hypergraphs that generalizes chordal graphs
- Combinatorial generation via permutation languages. I. Fundamentals
- Hypergraphic polytopes: combinatorial properties and antipode
- Acyclic reorientation lattices and their lattice quotients
- Combinatorial generation via permutation languages. III: Rectangulations
This page was built for publication: Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
