✦ LIBER ✦

Loops, Reflection Structures and Graphs with Parallelism

✍ Scribed by Helmut Karzel, Silvia Pianta, Elena Zizioli

Book ID: 120766451
Publisher: Springer
Year: 2002
Tongue: English
Weight: 752 KB
Volume: 42
Category: Article
ISSN: 1422-6383
DOI: 10.1007/BF03323555

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connections between loops of exponent 2,

Connections between loops of exponent 2, reflection structures and complete graphs with parallelism

✍ Elena Zizioli 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 824 KB

Left loops, bipartite graphs with parall

Left loops, bipartite graphs with parallelism and bipartite involution sets

✍ H. Karzel; S. Pianta 📂 Article 📅 2005 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 541 KB

Webs related to K-loops and reflection s

✍ Elisabetta Gabrieli; Bokhee Im; Helmut Karzel 📂 Article 📅 1999 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 565 KB

Solvability of bond graph junction struc

Solvability of bond graph junction structures with loops

✍ Rosenberg, R.; Andry, A., Jr. 📂 Article 📅 1979 🏛 IEEE ⚖ 891 KB

Fixed-edge theorem for graphs with loops

✍ Richard Nowakowski; Ivan Rival 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## Abstract Let __G__ be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of __G__ corresponds to a reflexive and symmetric binary relation on its set of vertices. Then __every edge‐preserving map of the set of vertices of G to itself fixes an edge__ [{__f

Parallel Algorithms for Series Parallel

Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1

✍ H. L. Bodlaender and B. van Antwerpen - de Fluiter 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 397 KB