3757 search results - page 77 / 752 » The overlap number of a graph |
ARSCOM
2007
14 years 10 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
DAM
2010
14 years 10 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
IM
2007
14 years 9 months ago
2007
The problem of radio channel assignments with multiple levels of interference depending on distance can be modeled using graph theory. The authors previously introduced a model of...
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
COMBINATORICS
2006
14 years 10 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...