✦ LIBER ✦

Circumference and girth

✍ Scribed by Cun-Quan Zhang

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 257 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130409

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be 2-connected graph with girth g and minimum degree d. Then each, pair of verticfs of G is joined by a path of length a t least maxi? (dl)g, ( d -?) (g -4) + 2) if g B 4, and the length of a longest cycle of G is at least max{[(d -1) (g -2) + 21, [(2d -3) (g -4) + 41).

📜 SIMILAR VOLUMES

Girth, minimum degree, and circumference

✍ M. N. Ellingham; D. K. Menser 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB

Orthogonal Polynomials on the Circumfere

Orthogonal Polynomials on the Circumference and Arcs of the Circumference

✍ Franz Peherstorfer; Robert Steinbauer 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Maximum Genus, Girth and Connectivity

✍ Deming Li; Yanpei Liu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 88 KB

In this paper, the lower bounds of maximum genera of simplicial graphs under the constraints of girth and connectivity are discussed extensively. A complete picture on the lower bounds of maximum genera of graphs is formed. There are infinitely many graphs with the maximum genera attaining these low

Girth in digraphs

✍ J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract For an integer __k__ > 2, the best function __m__(__n, k__) is determined such that every strong digraph of order __n__ with at least __m__(__n, k__) arcs contains a circuit of length __k__ or less.

Tree-width and circumference of graphs

✍ Etienne Birmele 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB

Independence, odd girth, and average deg

Independence, odd girth, and average degree

✍ Christian Löwenstein,; Anders Sune Pedersen,; Dieter Rautenbach;; Friedrich Rege 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

We prove several tight lower bounds in terms of the order and the average degree for the independence number of graphs that are connected and/or satisfy some odd girth condition. Our main result is the extension of a lower bound for the independence number of triangle-free graphs of maximum degree a