Elliot Krop

A Class of Graphs Approaching Vizing's Conjecture

For any graph

Almost-Rainbow Edge-Colorings of Some Small Subgraphs

G=(V,E)

All trees are six-cordial

, a subset

Vizing’s conjecture: A two-thirds bound for claw-free graphs

S\subseteq V

Distance magic cartesian products of graphs

\emph{dominates}

Improved Bounds for Relaxed Graceful Trees

G

General distance domination

if all vertices are contained in the closed neighborhood of

Variations of distance-based invariants of trees, to appear in Journal of Combinatorial Mathematics and Combinatorial Computing

S

ON THE EDGE-BALANCED INDEX SETS OF PRODUCT GRAPHS

, that is

A new bound for Vizing's conjecture

N[S]=V