𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pfaffian labelings and signs of edge colorings

✍ Scribed by Serguei Norine; Robin Thomas

Book ID
106167672
Publisher
Springer-Verlag
Year
2008
Tongue
English
Weight
253 KB
Volume
28
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic edge colorings of graphs
Acyclic edge colorings of graphs
✍ Noga Alon; Benny Sudakov; Ayal Zaks πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 102 KB

## Abstract A proper coloring of the edges of a graph __G__ is called __acyclic__ if there is no 2‐colored cycle in __G__. The __acyclic edge chromatic number__ of __G__, denoted by __aβ€²__(__G__), is the least number of colors in an acyclic edge coloring of __G__. For certain graphs __G__, __aβ€²__(_

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

Incidence and strong edge colorings of g
Incidence and strong edge colorings of graphs
✍ Richard A. Brualdi; Jennifer J. Quinn Massey πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 485 KB

We define the incidence coloring number of a graph and bound it in terms of the maximum degree. The incidence coloring number turns out to be the strong chromatic index of an associated bipartite graph. We improve a bound for the strong chromatic index of bipartite graphs all of whose cycle lengths