✦ LIBER ✦

On the length of longest chordless cycles

✍ Scribed by Cyriel Van Nuffelen; Kristel Van Rompay

Publisher: Springer
Year: 2005
Tongue: English
Weight: 63 KB
Volume: 3
Category: Article
ISSN: 1619-4500
DOI: 10.1007/s10288-005-0062-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Berge graphs with chordless cycles of bo

Berge graphs with chordless cycles of bounded length

✍ Rusu, Irena 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

A graph is called weakly triangulated if it contains no chordless cycle on five or more vertices (also called hole) and no complement of such a cycle (also called antihole). Equivalently, we can define weakly triangulated graphs as antihole-free graphs whose induced cycles are isomorphic either to C

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

On relative length of longest paths and

On relative length of longest paths and cycles

✍ Kenta Ozeki; Masao Tsugaki; Tomoki Yamashita 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract For a graph __G__, __p__(__G__) and __c__(__G__) denote the order of a longest path and a longest cycle of __G__, respectively. In this paper, we prove that if __G__ is a 3 ‐connected graph of order __n__ such that the minimum degree sum of four independent vertices is at least __n__+ 6

Relative Length of Longest Paths and Cyc

Relative Length of Longest Paths and Cycles in Graphs

✍ Huiqing Liu; Mei Lu; Feng Tian 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 120 KB

A bound on the chromatic number using th

A bound on the chromatic number using the longest odd cycle length

✍ Sreyash Kenkre; Sundar Vishwanathan 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract Let __G__ be a non‐bipartite graph with ℓ as the length of the longest odd cycle. Erdös and Hajnal proved that χ(__G__) ≤ ℓ + 1. We show that the only graphs for which this is tight are those that contain __K__~ℓ~ + 1 and further, if __G__ does not contain __K__~ℓ~ then χ(__G__) ≤ ℓ −1.

On the length of the longest excursion

✍ E. Csáki; P. Erdős; P. Révész 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 553 KB