Sciweavers

ENDM
2002
74views more  ENDM 2002»
13 years 11 months ago
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
Wayne Goddard, Michael A. Henning
COMBINATORICS
2002
93views more  COMBINATORICS 2002»
13 years 11 months ago
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
Alexandr V. Kostochka
DM
2007
136views more  DM 2007»
13 years 11 months ago
Lower connectivities of regular graphs with small diameter
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
Camino Balbuena, Xavier Marcote
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 11 months ago
Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
Eric Sopena