✦ LIBER ✦

A note on induced cycles in Kneser graphs

✍ Scribed by Y. Kohayakawa

Publisher: Springer-Verlag
Year: 1991
Tongue: English
Weight: 389 KB
Volume: 11
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01205076

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long induced paths and cycles in Kneser

Long induced paths and cycles in Kneser graphs

✍ Peter Alles; Svatopluk Poljak 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 209 KB

Two hamilton cycles in bipartite reflect

Two hamilton cycles in bipartite reflective kneser graphs

✍ I.J. Dejter; J. Cordova; J.A. Quintana 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 477 KB

A Note on Alternating Cycles in Edge-Col

A Note on Alternating Cycles in Edge-Coloured Graphs

✍ Anders Yeo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Grossman and Ha ggkvist gave a sufficient condition under which a two-edgecoloured graph must have an alternating cycle (i.e., a cycle in which no two consecutive edges have the same colour). We extend their result to edge-coloured graphs with any number of colours. That is, we show that if there is

A note on dominating cycles in 2-connect

A note on dominating cycles in 2-connected graphs

✍ D. Bauer; E. Schmeichel; H.J. Veldman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A Note on Cycle Lengths in Graphs

✍ R.J. Gould; P.E. Haxell; A.D. Scott 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 121 KB

A note on graphs whose neighborhoods are

A note on graphs whose neighborhoods aren-cycles

✍ Bruce L. Chilton; Ronald Gould; Albert D. Polimeni 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 220 KB

AnSTRACr. Let G be a graph, and let v be a vertex of G. We denote by N(v) the set of vertices of G which are adjacent to v, and by (N(v)) the subgraph of G induced by N(v). We call <N(v)) the neighborhood of v. In a paper of 1968, Agakishieva has, as one of her main theorems, the statement: "Graphs