𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On circuits in graphs

✍ Scribed by Mohamed H. El-Zahar

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
196 KB
Volume
50
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On removable circuits in graphs and matr
On removable circuits in graphs and matroids
✍ Lemos, Manoel; Oxley, James πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves

On circuits and pancyclic line graphs
On circuits and pancyclic line graphs
✍ A. Benhocine; L. Clark; N. KΓΆhler; H. J. Veldman πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 649 KB

Clark proved that L(G) is hamiltonian if G is a connected graph of order n 2 6 such that deg u + deg v 2 n -1p(n) for every edge uv of G, where p(n) = 0 if n is even and p(n) = 1 if n is odd. Here it is shown that the bound n -1 -dn) can be decreased to (2n + 1)/3 if every bridge of G is incident wi

Induced Circuits in Planar Graphs
Induced Circuits in Planar Graphs
✍ C. Mcdiarmid; B. Reed; A. Schrijver; B. Shepherd πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 291 KB