𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graham’s pebbling conjecture on product of complete bipartite graphs

✍ Scribed by Rongquan Feng; Ju Young Kim

Publisher
SP Science China Press
Year
2001
Tongue
English
Weight
318 KB
Volume
44
Category
Article
ISSN
1674-7283

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graham's pebbling conjecture on products
Graham's pebbling conjecture on products of cycles
✍ David S. Herscovici 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Chung defined a pebbling move on a graph __G__ to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number of a connected graph is the smallest number __f__(__G__) such that any distribution of __f__(__G__) pebbles on __G__

Solution of fink & straight conjecture o
Solution of fink & straight conjecture on path-perfect complete bipartite graphs
✍ Weiting Cao; Peter Hamburger 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB 👁 1 views

## Abstract We consider various edge disjoint partitions of complete bipartite graphs. One case is where we decompose the edge set into edge disjoint paths of increasing lengths. A graph __G__ is __path‐perfect__ if there is a positive integer __n__ such that the edge set __E__(__G__) of the graph

A note on packing trees into complete bi
A note on packing trees into complete bipartite graphs and on fishburn's conjecture
✍ Y. Caro; Y. Rodity 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 KB

In this note we improve significantly the result appeared in [4] by showing that any sequence of trees { T2, 'I;, . , T,} can be packed into the complete bipartite graph K,\_,,n,z (n even) for f = 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T,, T4,

On the Pagenumber of Complete Bipartite
On the Pagenumber of Complete Bipartite Graphs
✍ Hikoe Enomoto; Tomoki Nakamigawa; Katsuhiro Ota 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 324 KB

The pagenumber p(G) of a graph G is defined as the smallest n such that G can be embedded in a book with n pages. We give an upper bound for the pagenumber of the complete bipartite graph K m, n . Among other things, we prove p(K n, n ) w2nÂ3x+1 and p(K wn 2 Â4x, n ) n&1. We also give an asymptotic