Sciweavers

149
Voted
JGT
2011
76views more  JGT 2011»
15 years 1 days 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
106
Voted
JGT
2011
55views more  JGT 2011»
15 years 1 days ago
High-girth cubic graphs are homomorphic to the Clebsch graph
Matt DeVos, Robert Sámal
149
Voted
JGT
2011
109views more  JGT 2011»
15 years 1 days 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
101
Voted
JGT
2011
79views more  JGT 2011»
15 years 1 days ago
Bounds on vertex colorings with restrictions on the union of color classes
N. R. Aravind, C. R. Subramanian
124
Voted
JGT
2011
74views more  JGT 2011»
15 years 1 days ago
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
Zdenek Ryjácek, Petr Vrána
147
Voted
JGT
2011
59views more  JGT 2011»
15 years 1 days ago
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
Zdenek Ryjácek, Petr Vrána
105
Voted
JGT
2011
41views more  JGT 2011»
15 years 1 days ago
Short proofs for two theorems of Chien, Hell and Zhu
Tracy Holt, Yared Nigussie
118
Voted
JGT
2011
90views more  JGT 2011»
15 years 1 days ago
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Gábor Simonyi, Gábor Tardos