✦ LIBER ✦

Cycles through prescribed vertices with large degree sum

✍ Scribed by Katsuhiro Ota

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 366 KB
Volume: 145
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00036-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles through vertices of large maximum

Cycles through vertices of large maximum degree

✍ Bill Jackson 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 442 KB

## Abstract Let __G__ be a 2‐connected graph on __n__ vertices with maximum degree __k__ where __n__ ≤ 3__k__ ‐ 2. We show that there is a cycle in __G__ that contains all vertices of degree __k.__ © 1995 John Wiley & Sons, Inc.

Cycles containing many vertices of large

Cycles containing many vertices of large degree

✍ H.J. Veldman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Veldman, H.J., Cycles containing many vertices of large degree, Discrete Mathematics 101 (1992) 319-325. Let G be a 2-connected graph of order n, r a real number and V, = {u E V(G) ( d(v) 3 r}.

On cycles through prescribed vertices in

On cycles through prescribed vertices in weakly separable graphs

✍ A.K. Kelmans; M.V. Lomonosov 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Notions and notations 1.1. Given an undirected graph G let V(G), E(G), K(G) and comp(G) denote the vertex-set, edge-set, vertex connectivity and number of components of G, respectively. Put P(G)={(X, Y): X~V(G), Tc\\_E(G--X)}. For X~V(G) let G(X) denote the induced suL\\*graph. For Y :\\_ E(G) let G

Cycles through Large Degree Vertices in

Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem

✍ Kenneth A. Berman; Xin Liu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let D=(V, E) be a digraph with vertex set V of size n and arc set E. For u # V, let d(u) denote the degree of u. A Meyniel set M is a subset of V such that d(u)+d(v) 2n&1 for every pair of nonadjacent vertices u and v belonging to M. In this paper we show that if D is strongly connected, then every

Long cycles in graphs with large degree

Long cycles in graphs with large degree sums

✍ Douglas Bauer; H.J. Veldman; A. Morgana; E.F. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Long cycles in subgraphs with prescribed

Long cycles in subgraphs with prescribed minimum degree

✍ L. Caccetta; K. Vijayan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 621 KB

## Caccetta, L. and K. Vijayan, Long cycles in subgraphs with