Search Sciweavers | Sciweavers

721 search results - page 2 / 145

» Bounds on the k-domination number of a graph

click to vote

CORR
2011
Springer

174views Education» more CORR 2011»

Lower bounds on the obstacle number of graphs

12 years 12 months ago

Download www.cs.elte.hu

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...

Padmini Mukkamala, János Pach, Döm&oum...

claim paper

Read More »

click to vote

ENDM
2002

134views more ENDM 2002»

Bounds on the signed domination number of a graph

13 years 4 months ago

Download www.cs.cornell.edu

Let G = (V, E) be a simple graph on vertex set V and define a function f : V {-1, 1}. The function f is a signed dominating function if for every vertex x V, the closed neighbor...

Ruth Haas, Thomas B. Wexler

claim paper

Read More »

click to vote

COMBINATORICS
1998

81views more COMBINATORICS 1998»

An Improved Bound on the Minimal Number of Edges in Color-Critical Graphs

13 years 4 months ago

Download www.combinatorics.org

Michael Krivelevich

claim paper

Read More »