𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homomorphisms of Edge-Colored Graphs and Coxeter Groups

✍ Scribed by N. Alon; T.H. Marshall

Book ID
110264659
Publisher
Springer
Year
1998
Tongue
English
Weight
117 KB
Volume
8
Category
Article
ISSN
0925-9899

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Colored Homomorphisms of Colored Mixed G
Colored Homomorphisms of Colored Mixed Graphs
✍ Jaroslav NeΕ‘etΕ™il; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 108 KB

The homomorphisms of oriented or undirected graphs, the oriented chromatic number, the relationship between acyclic coloring number and oriented chromatic number, have been recently studied. Improving and combining earlier techniques of N.

Edge-colored saturated graphs
Edge-colored saturated graphs
✍ D. Hanson; B. Toft πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 266 KB
Computer generation of edge groups and e
Computer generation of edge groups and edge colorings of graphs
✍ Xiaoyu Liu; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 810 KB

A computer code and nonnumerical algorithm are developed to construct the edge group of a graph and to enumerate the edge colorings of graphs of chemical interest. The edge colorings of graphs have many applications in nuclear magnetic resonance (NMR), multiple quantum NMR, enumeration of structural

Decompositions of Edge-Colored Complete
Decompositions of Edge-Colored Complete Graphs
✍ Esther R. Lamken; Richard M. Wilson πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 538 KB

We prove an asymptotic existence theorem for decompositions of edge-colored complete graphs into prespecified edge-colored subgraphs. Many combinatorial design problems fall within this framework. Applications of our main theorem require calculations involving the numbers of edges of each color and