223 search results - page 8 / 45 » A Note on Graph Pebbling |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We prove that there is an absolute constant C > 0 so that for every natural n there exists a trianglefree regular graph with no independent set of size at least C n log n.
DM
2006
13 years 7 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
EJC
2010
13 years 7 months ago
2010
We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z3 2
COMBINATORICS
2000
13 years 7 months ago
2000
In this paper we consider the problem of establishing a value r0 such that almost all random graphs with n vertices and rn edges, r > r0, are asymptotically not 3-colorable. In...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...