Sciweavers

JGT
2011
76views more  JGT 2011»
13 years 6 months ago
Intersections of graphs
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...
Béla Bollobás, Alex D. Scott
JGT
2011
109views more  JGT 2011»
13 years 6 months ago
Total weight choosability of graphs
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...
Tsai-Lien Wong, Xuding Zhu
JGT
2011
41views more  JGT 2011»
13 years 6 months ago
Short proofs for two theorems of Chien, Hell and Zhu
Tracy Holt, Yared Nigussie