Evacuation of labelled graphs

DOI10.1016/0012-365X(92)00569-DzbMath0811.05059WikidataQ127933210 ScholiaQ127933210MaRDI QIDQ1336658

Claudia Malvenuto, Christophe Reutenauer

Publication date: 18 April 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

evacuationlabelled graphs

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (11)

Toric promotion ⋮ Upper Bounds on Mixing Time of Finite Markov Chains ⋮ Effective Poset Inequalities ⋮ Polyurethane toggles ⋮ Promotion sorting ⋮ Markov Chains for Promotion Operators ⋮ Linear extensions and shelling orders ⋮ Random shuffles on trees using extended promotion ⋮ Combinatorial Markov chains on linear extensions ⋮ Properties of the promotion Markov chain on linear extensions ⋮ Markov chains, ${\mathscr R}$-trivial monoids and representation theory

Cites Work

• Unnamed Item
• Unnamed Item
• Dual equivalence with applications, including a conjecture of Proctor
• Promotion des morphismes d'ensembles ordonnes
• Balanced tableaux
• Quelques remarques sur une Construction de Schensted.

This page was built for publication: Evacuation of labelled graphs