𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Crossings and Nestings of Two Edges in Set Partitions

✍ Scribed by Poznanović, Svetlana; Yan, Catherine

Book ID
118197016
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
251 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of graphs into one or two ind
Partitions of graphs into one or two independent sets and cliques
✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized

Routing a Permutation in the Hypercube b
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths
✍ Qian-Ping Gu; Hisao Tamaki 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths.