𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Group connectivity and group colorings of graphs — A survey

✍ Scribed by Hong-Jian Lai; Xiangwen Li; Yehong Shao; Mingquan Zhan

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2010
Tongue
English
Weight
469 KB
Volume
27
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Group connectivity of complementary grap
Group connectivity of complementary graphs
✍ Xinmin Hou; Hong-Jian Lai; Ping Li; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Let __G__ be a 2‐edge‐connected undirected graph, __A__ be an (additive) abelian group and __A__\* = __A__−{0}. A graph __G__ is __A__‐connected if __G__ has an orientation __D__(__G__) such that for every function __b__: __V__(__G__)↦__A__ satisfying , there is a function __f__: __E__(

On Group Connectivity of Graphs
On Group Connectivity of Graphs
✍ Hong-Jian Lai; Rui Xu; Ju Zhou 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 133 KB
A note on group colorings
A note on group colorings
✍ Daniel Král'; Ondřej Pangrác; Heinz-Jürgen Voss 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## Abstract We study a concept of group coloring introduced by Jaeger et al. We show that the group chromatic number of a graph with minimum degree δ is greater than δ/(2, ln δ) and we answer several open questions on the group chromatic number of planar graphs: a construction of a bipartite planar

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