8 search results - page 2 / 2 » jgt 2011 |
JGT
2011
12 years 12 months ago
2011
JGT
2011
12 years 12 months ago
2011
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
JGT
2011
12 years 12 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...