✦ LIBER ✦

Paths and cycles of hypergraphs

✍ Scribed by Jianfang Wang; Tony T. Lee

Publisher: SP Science China Press
Year: 1999
Tongue: English
Weight: 638 KB
Volume: 42
Category: Article
ISSN: 1674-7283
DOI: 10.1007/bf02872044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Closures, cycles, and paths

✍ Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB

## Abstract In 1960 Ore proved the following theorem: Let __G__ be a graph of order __n__. If __d__(__u__) + __d__(__v__)≥__n__ for every pair of nonadjacent vertices __u__ and __v__, then __G__ is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have

The Square of Paths and Cycles

✍ G.H. Fan; H.A. Kierstead 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The square of a path (cycle) is the graph obtained by joining every pair of vertices of distance two in the path (cycle). Let \(G\) be a graph on \(n\) vertices with minimum degree \(\delta(G)\). Posa conjectured that if \(\delta(G) \geqslant \frac{2}{3} n\), then \(G\) contains the square of a hami

Paths extendable to cycles

✍ T. D. Parsons 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Let __k__ be a positive integer, and __S__ a nonempty set of positive integers. Suppose that __G__ is a connected graph containing a path of length __k__, and that each path __P__ of length __k__ in __G__ is contained in some cycle __C__(__P__) of length s ∈ __S__. We prove that every p

Existence of Δλ-cycles and Δλ-paths

✍ H. J. Broersma 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 398 KB

Decompositions of digraphs into paths an

Decompositions of digraphs into paths and cycles

✍ Malaz Maamoun 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Hamilton Cycles and Paths in Fullerenes.

✍ Dragan Marusic 📂 Article 📅 2007 🏛 John Wiley and Sons ⚖ 11 KB