✦ LIBER ✦

On the diameter of reconfiguration graphs for vertex colourings

✍ Scribed by Marthe Bonamy; Matthew Johnson; Ioannis Lignos; Viresh Patel; Daniël Paulusma

Book ID: 119236551
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 177 KB
Volume: 38
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.09.028

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved bound on parity vertex colou

An improved bound on parity vertex colourings of outerplane graphs

✍ Weifan Wang; Stephen Finbow; Ping Wang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 368 KB

On 3--vertex critical graphs of diameter

On 3--vertex critical graphs of diameter three

✍ Mustapha Chellali; Nader Jafari Rad; Abdollah Khodkar 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 354 KB

The diameter of total domination vertex

The diameter of total domination vertex critical graphs

✍ Wayne Goddard; Teresa W. Haynes; Michael A. Henning; Lucas C. van der Merwe 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 193 KB

On the number of edge-colourings of regu

On the number of edge-colourings of regular bipartite graphs

✍ A. Schrijver 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 562 KB

On the Diameter of Wenger Graphs

✍ Raymond Viglione 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 195 KB

On the diameters of commuting graphs

✍ S. Akbari; A. Mohammadian; H. Radjavi; P. Raja 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The commuting graph of a ring R, denoted by (R), is a graph whose vertices are all non-central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. Let D be a division ring and n 3. In this paper we investigate the diameters of (M n (D)) and determine the diameters of