125
Voted
JGT
2011
14 years 9 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...
94
Voted
JGT
2011
14 years 9 months ago
2011
129
Voted
JGT
2011
14 years 9 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...
89
Voted
JGT
2011
14 years 9 months ago
2011
111
Voted
JGT
2011
14 years 9 months ago
2011
134
Voted
JGT
2011
14 years 9 months ago
2011
91
Voted
JGT
2011
14 years 9 months ago
2011
102
Voted
JGT
2011
14 years 9 months ago
2011