It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of giv...