7 problems
Let be a complete full -ary tree, meaning a rooted tree in which every nonleaf has exactly children and all leaves have the same depth. Let be the number of leaves a…
Liang's conjecture. If every node in has degree at most and every node in has degree at most , then has a matching and a family of node-disjoin…
Let be a graph with pendant edges, let be its maximum degree, and let denote its local total antimagic chromatic number. Local total antimagic bo…
Let be a graph and let be a positive integer. Write for the disjoint union of and copies of , and let be the maximum integer such that…
Let be a caterpillar, and let be a subdivided caterpillar, meaning a subdivision of in which all edges of that are not on the central path of are subdivided the…
Let be a graph, and let be an integer. A -shifted-antimagic labeling of is an injective edge labeling by the consecutive integers such that…
Let be a graph with edges and no isolated edge. For each vertex , let be the sum of the labels on edges incident with . A distance-two antimagic labelling uses…