๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs

โœ Scribed by Victor Klee; Howard Quaife

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
454 KB
Volume
23
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Coloured knots and coloured graphs repre
Coloured knots and coloured graphs representing 3-fold simple coverings of %plane1D;54A;3
โœ Mari Rita Casali ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 525 KB

It is well-known that every closed orientable 3-manifold M 3 is the 3-fold simple covering M3(K,o)) of S 3 branched over a knot K: hence, M 3 may be visualized by the associated coloured knot (K, co). On the other hand, PL-manifolds of arbitrary dimension may be represented by coloured graphs, via p

Long Cycles and 3-Connected Spanning Sub
Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in 3-Connected K1, d-Free Graphs
โœ B. Jackson; N.C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

Let \(G\) be a 3-connected \(K_{1, d}\)-free graph on \(n\) vertices. We show that \(G\) contains a 3-connected spanning subgraph of maximum degree at most \(2 d-1\). Using an earlier result of ours, we deduce that \(G\) contains a cycle of length at least \(\frac{1}{2} n^{c}\) where \(c=\left(\log