• Diameter and Traversability of k–edge–d–critical graphs

Abstract

Let k and d be positive integers with k 2d. Let = {0, 1, 2,…, k-1} be the set of integers modulo k. Let (x, y) = min {, k– } for x, y . A pseudo complete d–coloring of G using k colors is a mapping.....