Paper Info
Title
Existence of equitable h-edge-colorings of type s = 2, 3 of Kt.
Abstract
An h-edge-coloring (block-coloring) of type s of a graph G is a assignment of h colors to the edges (blocks) of G such that for every vertex x of G the edges (blocks) incident with x are colored with s colors. For every color i, xi(x,i)(B-x,B-i) denotes the set of all edges (blocks) incident with x and colored by i. An h-edge-coloring (h-block-coloring) of type s is equitable if for every vertex x and for colors i, j, vertical bar vertical bar xi(x,j) vertical bar - vertical bar xi(x,j) vertical bar vertical bar <= 1 (vertical bar vertical bar B-x,B-i vertical bar - vertical bar B-x,B-j vertical bar vertical bar <= 1). In this paper we study the existence of h-edge-coloring of type s = 2, 3 of K-t and then show that the solution of this problem induces the solution of the existence of a C-4- K-t(2)-design having an equitable h-block-coloring of type s = 2, 3.
Year
Venue
Keywords
2017
ARS COMBINATORIA
Edge-Coloring,Block-Coloring,Design,Graph
DocType
Volume
ISSN
Journal
131
0381-7032
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
A. Ilkhani100.34
Dariush Kiani2265.86