𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of forcibly k-variegated degree sequences, k⩾3

✍ Scribed by Medha Javdekar

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
749 KB
Volume
29
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of some {3vμ + 1, 3vμ
A characterization of some {3vμ + 1, 3vμ; k - 1, q}-minihypers and some [n, k, qk-1 - 3qμ; q]-codes (k ⩾ 3, q ⩾ 5, 1 ⩽ μ < k - 1) meeting the Griesmer bound
✍ Noboru Hamada; Tor Helleseth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

For any In, k, d; q]-code the Griesmer bound says that n >t ~ F d/q' 7. The purpose of this paper is to characterize all In, k, qk-1 \_ 3q~; q]-codes meeting the Griesmer bound in the case where k >/3, q >~ 5 and 1 ~</~ < k -1. It is shown that all such codes have a generator matrix whose columns co

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