✦ LIBER ✦

Long induced paths and cycles in Kneser graphs

✍ Scribed by Peter Alles; Svatopluk Poljak

Publisher: Springer Japan
Year: 1989
Tongue: English
Weight: 209 KB
Volume: 5
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788684

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long paths and cycles in oriented graphs

✍ Bill Jackson 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

## Abstract We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge‐disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamilto

Long paths and cycles in tough graphs

✍ H. J. Broersma; J. van den Heuvel; H. A. Jung; H. J. Veldman 📂 Article 📅 1993 🏛 Springer Japan 🌐 English ⚖ 575 KB

A note on induced cycles in Kneser graph

A note on induced cycles in Kneser graphs

✍ Y. Kohayakawa 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 389 KB

Long paths and large cycles in finite gr

Long paths and large cycles in finite graphs

✍ Hikoe Enomoto 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

PATHS AND CYCLES IN COLORED GRAPHS

✍ Xueliang LI; Shenggui Zhang; Hajo Broersma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Long dominating cycles and paths in grap

Long dominating cycles and paths in graphs with large neighborhood unions

✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.