✦ LIBER ✦

Cycles with a chord are graceful

✍ Scribed by C. Delorme; M. Maheo; H. Thuillier; K. M. Koh; H. K. Teo

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 162 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040410

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Directed cycles with chords

✍ Marcus, Daniel A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

Using a variation of Thomassen's admissible triples technique, we give an alternative proof that every strongly 2-arc-connected directed graph with two or more vertices contains a directed cycle that has at least two chords, while at the same time establishing a more general result.

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

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

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

Directed Cycles with Two Chords and Stro

Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs

✍ Carsten Thomassen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 314 KB

We prove the conjecture of D. A. Marcus (1981) that every strongly 2-arcconnected directed graph has a directed cycle with at least two chords. As a consequence, every strongly 2-arc-connected directed graph with m arcs has a spanning strong directed subgraph with less than 2 3 m arcs. The constant

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