ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

On the Signed Domination in Graphs (2000)

Matoušek, Jiří

Springer

Combinatorica 20 (2000), S. 103-108

add to mindlist on the mindlist

Details

ISSN: 1439-6912

Keywords: AMS Subject Classification (1991) Classes: 05C78, 05D15

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: G on n vertices with minimum degree r, there exists a two-coloring of the vertices of G with colors +1 and -1, such that the closed neighborhood of each vertex contains more +1's than -1's, and altogether the number of 1's does not exceed the number of -1's by more than . As a construction by Füredi and Mubayi shows, this is asymptotically tight. The proof uses the partial coloring method from combinatorial discrepancy theory.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/s004930070034

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit