Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Almost-Rainbow Edge-Colorings of Some Small Subgraphs

Elliot Krop;  Irina Krop — 2013

Discussiones Mathematicae Graph Theory

Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás. We show that [...] , slightly improving the bound of Axenovich. We make small improvements on bounds of Erdös and Gyárfás by showing [...] and for all even n ≢ 1(mod 3), f(n, 4, 5) ≤ n− 1. For a complete bipartite graph G= Kn,n, we show an n-color construction to color the edges...

Distance Magic Cartesian Products of Graphs

Sylwia Cichacz;  Dalibor Froncek;  Elliot Krop;  Christopher Raridan — 2016

Discussiones Mathematicae Graph Theory

A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . . , n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant. In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four...

Page 1

Download Results (CSV)