223 search results - page 4 / 45 » A Note on Graph Pebbling |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
GD
2004
Springer
14 years 1 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
IWOCA
2009
Springer
14 years 5 days ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
SIAMDM
2008
13 years 7 months ago
2008
In [5], Reed conjectures that every graph satisfies ++1 2 . We prove this holds for graphs with disconnected complement. Combining this fact with a result of Molloy proves the co...
EJC
2002
13 years 7 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...