JGT 2011 | Sciweavers

45

JGT
2011

76views more JGT 2011»

13 years 7 months ago

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

claim paper

Read More »

27

click to vote

JGT
2011

55views more JGT 2011»

High-girth cubic graphs are homomorphic to the Clebsch graph

13 years 7 months ago

Download kam.mff.cuni.cz

Matt DeVos, Robert Sámal

claim paper

Read More »

40

click to vote

JGT
2011

109views more JGT 2011»

Total weight choosability of graphs

13 years 7 months ago

Download www.math.nsysu.edu.tw

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

claim paper

Read More »

27

click to vote

JGT
2011

79views more JGT 2011»

Bounds on vertex colorings with restrictions on the union of color classes

13 years 7 months ago

Download www.imsc.res.in

N. R. Aravind, C. R. Subramanian

claim paper