✦ LIBER ✦

Green's relations on the strong endomorphism monoid of a graph

✍ Scribed by Weimin Li

Book ID: 110560851
Publisher: Springer
Year: 1993
Tongue: English
Weight: 326 KB
Volume: 47
Category: Article
ISSN: 0037-1912
DOI: 10.1007/bf02573757

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Endomorphisms of graphs I. The monoid of

Endomorphisms of graphs I. The monoid of strong endomorphisms

✍ Ulrich Knauer; Martin Nieporte 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 405 KB

The monoid of strong endomorphisms of a

The monoid of strong endomorphisms of a graph

✍ Weimin Li 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 361 KB

The join of split graphs whose half-stro

The join of split graphs whose half-strong endomorphisms form a monoid

✍ Hai Long Hou; Yan Feng Luo; Rui Gu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 212 KB

The Join of Split Graphs Whose Regular E

The Join of Split Graphs Whose Regular Endomorphisms Form a Monoid

✍ Hou, Hailong; Gu, Rui; Shang, Youlin 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 138 KB

A note on the green's relation ℋ

✍ Ildikó Kiss 📂 Article 📅 1972 🏛 Akadmiai Kiad 🌐 English ⚖ 194 KB

A Bound on the Strong Chromatic Index of

A Bound on the Strong Chromatic Index of a Graph

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

We show that the strong chromatic index of a graph with maximum degree 2 is at most (2&=) 2 2 , for some =>0. This answers a question of Erdo s and Nes etr il. 1997 Academic Press ## 1. Introduction A strong edge-colouring of a (simple) graph, G, is a proper edge-colouring of G with the added res