4 citations · 4 across the 2 of their papers we have counts for
Showing 1999 · math.COShow all
3 papers · 2 filters
math.CO1999
Multiple vertex coverings by specified induced subgraphs
Zoltan Furedi, Dhruv Mubayi, Douglas B. West
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum o…
math.CO1999
Coloring of Trees with Minimum Sum of Colors
Tao Jiang, Douglas B. West
The chromatic sum of a graph is the smallest sum of colors among all proper colorings with natural numbers. The strength is the minimum number of colors needed to achieve the chrom…
math.CO1999
Edge-bandwidth of graphs
Tao Jiang, Dhruv Mubayi, Aditya Shastri +1
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that…