✦ LIBER ✦

A vertex cover with chorded 4-cycles

✍ Scribed by Yun Shu Gao; Guo Jun Li; Jin Yan

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2011
Tongue: English
Weight: 218 KB
Volume: 27
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-011-9531-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-disjoint chorded cycles in a grap

Vertex-disjoint chorded cycles in a graph

✍ Shengning Qiao; Shenggui Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Cycles with a chord are graceful

✍ C. Delorme; M. Maheo; H. Thuillier; K. M. Koh; H. K. Teo 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract In this paper, we prove that every cycle plus a chord is graceful, thus answering a conjecture of R. Bodendiek, H. Schumacher, and H. Wegner.

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl

A note on a conjecture about cycles with

A note on a conjecture about cycles with many incident chords

✍ Tao Jiang 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 44 KB

## Abstract Given positive integers __n__ and __k__, let __g__~__k__~(__n__) denote the maximum number of edges of a graph on __n__ vertices that does not contain a cycle with __k__ chords incident to a vertex on the cycle. Bollobás conjectured as an exercise in [2, p. 398, Problem 13] that there e

Cycle covers of graphs with a nowhere-ze

Cycle covers of graphs with a nowhere-zero 4-flow

✍ André Raspaud 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB 👁 1 views

## Abstract It is shown that the edges of a simple graph with a nowhere‐zero 4‐flow can be covered with cycles such that the sum of the lengths of the cycles is at most |__E__(__G__)| + |__V__(__G__)| −3. This solves a conjecture proposed by G. Fan.

A structure theorem for graphs with no c

A structure theorem for graphs with no cycle with a unique chord and its consequences

✍ Nicolas Trotignon; Kristina Vušković 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

## Abstract We give a structural description of the class 𝒞 of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in 𝒞 is either in some simple basic class or has a decomposition. Basic classes are chordless cycles, cliqu