✦ LIBER ✦

Longest Simple Paths in Polyhedral Graphs

✍ Scribed by Grunbaum, B.; Motzkin, T. S.

Book ID: 120098077
Publisher: Oxford University Press
Year: 1962
Tongue: English
Weight: 203 KB
Volume: s1-37
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s1-37.1.152

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Longest cycles in polyhedral graphs

✍ Hansjoachim Walther 📂 Article 📅 1993 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 254 KB

Longest Paths and Longest Cycles in Grap

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

✍ Ingo Schiermeyer; Meike Tewes 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 139 KB

Longest paths and cycles in bipartite or

Longest paths and cycles in bipartite oriented graphs

✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Longest paths and cycles in K1,3-free gr

Longest paths and cycles in K1,3-free graphs

✍ Manton M. Matthews; David P. Sumner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

In this article w e show that the standard results concerning longest paths and cycles in graphs can be improved for K,,,-free graphs. We obtain as a consequence of these results conditions for the existence of a hamiltonian path and cycle in K,,,-free graphs.

The longest path in a random graph

✍ Miklós Ajtai; János Komlós; Endre Szemerédi 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 571 KB

Intersection of Longest Paths in a Graph

✍ Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabaya 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 187 KB