✦ LIBER ✦

Evacuation of labelled graphs

✍ Scribed by Claudia Malvenuto; Christophe Reutenauer

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 338 KB
Volume: 132
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00569-d

No coin nor oath required. For personal study only.

✦ Synopsis

In this note, we extend Schiitzenberger's evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged.

📜 SIMILAR VOLUMES

Skolem labelled graphs

✍ E. Mendelsohn; N. Shalaby 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 814 KB

Group labelings of graphs

✍ Paul H. Edelman; Michael Saks 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Given a graph Γ an abelian group __G__, and a labeling of the vertices of Γ with elements of __G__, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such

Counting labelled 3-connected graphs

✍ Nicholas Wormald 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 62 KB

Harmonious labelings of windmill graphs

Harmonious labelings of windmill graphs and related graphs

✍ D. Frank Hsu 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ ≥ 1, __K__^(__t__^)~__n__~ is strongly

On sequential labelings of graphs

✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

Labeling angles of planar graphs

✍ Feodor Loupekine; John J. Watkins 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 387 KB

A well-known theorem of Heawood states that 3-edge-coloring bridgeless planar cubic graphs-and, hence, the four-color theorem-is equivalent to labeling vertices with either +1 or -1 so that the sum around any face is 0 (mod 3). In this paper we introduce the notion of "angle-labeling" and give resul