EL-Labelings and Canonical Spanning Trees for Subword Complexes

DOI10.1007/978-3-319-00200-2_13zbMath1271.05025arXiv1210.1435MaRDI QIDQ2849001

Christian Stump, Vincent Pilaud

Publication date: 13 September 2013

Published in: Discrete Geometry and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1435

zbMATH Keywords

Möbius function; exhaustive generation; spanning trees; enumeration algorithm; subword complexes; EL-labelings; increasing flips

Mathematics Subject Classification ID

05C05: Trees

68R05: Combinatorics in computer science

68R10: Graph theory (including graph drawing) in computer science

06A07: Combinatorics of partially ordered sets

20F55: Reflection and Coxeter groups (group-theoretic aspects)

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05E45: Combinatorial aspects of simplicial complexes

Uses Software

• SageMath