𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The linear arrangement problem on recursively constructed graphs

✍ Scribed by S. B. Horton; T. Easton; R. Gary Parker

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
87 KB
Volume
42
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the linear arboricity of planar graph
On the linear arboricity of planar graphs
✍ Wu, Jian-Liang πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 188 KB πŸ‘ 2 views

The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. Akiyama, Exoo, and Harary conjectured for any simple graph G with maximum degree βˆ†. The conjecture has been proved to be true for graphs having βˆ† =

On the Ramsey Problem for Multicolor Bip
On the Ramsey Problem for Multicolor Bipartite Graphs
✍ W.A Carnielli; E.L Monte Carmelo πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 85 KB

Given i, j positive integers, let K denote a bipartite complete graph and let i, j ## Ε½ . R m, n be the smallest integer a such that for any r-coloring of the edges of K r a, a one can always find a monochromatic subgraph isomorphic to K . In other m, n Ε½ . Γ„ 4 words, if a G R m, n then every mat

On the Linear Diophantine Problem of Fro
On the Linear Diophantine Problem of Frobenius
✍ J.L. Davison πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 351 KB

Suppose \(a, b, c\) are three positive integers with \(\mathrm{gcd}=1\). We consider the function \(f(a, b, c)\) defined to be the largest integer not representable as a positive integral linear combination of \(a, b, c\). We give a new lower bound for \(f(a, b, c)\) which is shown to be tight, and