✦ LIBER ✦

Covering vertices by cycles

✍ Scribed by Mekkia Kouider

Book ID: 102893210
Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 900 KB
Volume: 18
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190180802

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

“If G is a 2‐connected graph with n vertices and minimum degree d, then the vertices of G can be covered by less than n/d cycles. This settles a conjecture of Enomoto, Kaneko and Tuza for 2‐connected graphs.”

📜 SIMILAR VOLUMES

Neighborhoods and Covering Vertices by C

Neighborhoods and Covering Vertices by Cycles

✍ Mekkia Kouider 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 171 KB

Covering vertices by a specified number

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices

✍ Shuya Chiba; Shinya Fujita 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Covering the vertices of a digraph by cy

Covering the vertices of a digraph by cycles of prescribed length

✍ D. Amar; A. Raspaud 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 427 KB

the vertices of a digraph by cycles of prescribed length, Discrete Mathematics 87 (

Covering the vertices of a graph by cycl

Covering the vertices of a graph by cycles of prescribed length

✍ D. Amar; I. Fournier; A. Germa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe

Covering Graphs by Cycles

✍ Fan, Genghua 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 687 KB

Cycles through specified vertices

✍ Béla Bollobás; Graham Brightwell 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 552 KB