๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph edge colorings and their chemical applications

โœ Scribed by Krishnan Balasubramanian

Publisher
Springer
Year
1988
Tongue
English
Weight
578 KB
Volume
74
Category
Article
ISSN
1432-2234

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge-partitions of planar graphs and the
Edge-partitions of planar graphs and their game coloring numbers
โœ Wenjie He; Xiaoling Hou; Ko-Wei Lih; Jiating Shao; Weifan Wang; Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 98 KB ๐Ÿ‘ 1 views

Let G be a planar graph and let g(G) and ร(G) be its girth and maximum degree, respectively. We show that G has an edge-partition into a forest and a subgraph H so that (i) -cycles (though it may contain 3-cycles). These results are applied to find the following upper bounds for the game coloring n

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

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