✦ LIBER ✦

On dominating and spanning circuits in graphs

✍ Scribed by H.J. Veldman

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 680 KB
Volume: 124
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00063-w

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence of spanning and dominating tra

Existence of spanning and dominating trails and circuits

✍ H. J. Veldman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. Tis a dominating trail (D-trail) if every edge of G is incident with a t least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of v

On circuits in graphs

✍ Mohamed H. El-Zahar 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 196 KB

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

Spanning triangulations in graphs

✍ Daniela Kühn; Deryk Osthus 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 467 KB

## Abstract We prove that every graph of sufficiently large order __n__ and minimum degree at least 2__n__/3 contains a triangulation as a spanning subgraph. This is best possible: for all integers __n__, there are graphs of order __n__ and minimum degree ⌈2__n__/3⌉ − 1 without a spanning triangul

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

On the length of longest dominating cycl

On the length of longest dominating cycles in graphs

✍ Hoa Vu Dinh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Vu Dinh, H., On the length of longest dominating cycles in graphs, Discrete Mathematics 121 (1993) 21 l-222. ## A cycle C in an undirected and simple graph if G contains a dominating cycle. There exists l-tough graph in which no longest cycle is dominating. Moreover, the difference of the length