✦ LIBER ✦

On the length of the longest excursion

✍ Scribed by E. Csáki; P. Erdős; P. Révész

Publisher: Springer
Year: 1985
Tongue: English
Weight: 553 KB
Volume: 68
Category: Article
ISSN: 1432-2064
DOI: 10.1007/bf00532646

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the length of longest chordless cycle

On the length of longest chordless cycles

✍ Cyriel Van Nuffelen; Kristel Van Rompay 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 63 KB

On the longest length of consecutive int

On the longest length of consecutive integers

✍ Min Zhi Zhao; Qi-Man Shao 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 196 KB

On the length of the longest increasing

On the length of the longest increasing run in Rd

✍ Andrei N. Frolov; Alexander I. Martikainen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 407 KB

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

The shortest possible length of the long

The shortest possible length of the longest implicational axiom

✍ Dolph Ulrich 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 384 KB

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