𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic automorphisms of graphs

✍ Scribed by V Chvátal; J Sichler

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
361 KB
Volume
14
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic automorphisms and symmetries o
Chromatic automorphisms and symmetries of some graphs
✍ S. Stueckle 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Certain colored graphs are defined in terms of permutations in S, and the edge-chromatic automorphism groups of these graphs are studied. In fact, these groups are characterized in terms of the associated permutations. These groups are related to the groups of symmetries of certain drawings of cycle

Chromaticity of triangulated graphs
Chromaticity of triangulated graphs
✍ Paul Vaderlind 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A graph G is called triangulated (or rigid-circuit graph, or chordal graph) if every circuit of G with length greater than 3 has a chord. It can be shown (see, UI, . . . , u,, . Let G = G,.

Path chromatic numbers of graphs
Path chromatic numbers of graphs
✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB