✦ LIBER ✦

Long cycles in subgraphs with prescribed minimum degree

✍ Scribed by L. Caccetta; K. Vijayan

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 621 KB
Volume: 97
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90423-y

No coin nor oath required. For personal study only.

✦ Synopsis

Caccetta,

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

📜 SIMILAR VOLUMES

Long cycles in graphs with prescribed to

Long cycles in graphs with prescribed toughness and minimum degree

✍ Douglas Bauer; H.J. Broersma; J. van den Heuvel; H.J. Veldman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A cycle C of a graph G is a D~-cycle if every component of G-V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2-

Long cycles in graphs with no subgraphs

Long cycles in graphs with no subgraphs of minimal degree 3

✍ Béla Bollobás; Graham Brightwell 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Cycles through prescribed vertices with

Cycles through prescribed vertices with large degree sum

✍ Katsuhiro Ota 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 366 KB

Cycle lengths in graphs with large minim

Cycle lengths in graphs with large minimum degree

✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Our main result is the following theorem. Let __k__ ≥ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __δ__(__G__) ≥ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__ ∈ [4, __δ__(__G__) + 1]. If __G__ is nonbipartite then

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

Light subgraphs in planar graphs of mini

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9

✍ B. Mohar; R. Škrekovski; H.-J. Voss 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

## Abstract A graph __H__ is light in a given class of graphs if there is a constant __w__ such that every graph of the class which has a subgraph isomorphic to __H__ also has a subgraph isomorphic to __H__ whose sum of degrees in __G__ is ≤ __w__. Let $\cal G$ be the class of simple planar graphs