✦ LIBER ✦

An Orientation Theorem for Graphs

✍ Scribed by A.M.H. Gerards

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 519 KB
Volume: 62
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1994.1064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A theorem on pancyclic-oriented graphs

✍ Maria Overbeck-Larisch 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 275 KB

An algorithm for fraternal orientation o

An algorithm for fraternal orientation of graphs

✍ J. Urrutia; F. Gavril 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 339 KB

An accessibility theorem for infinite gr

An accessibility theorem for infinite graph minors

✍ Reinhard Diestel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

An 11-vertex theorem for 3-connected cub

An 11-vertex theorem for 3-connected cubic graphs

✍ R. E. L. Aldred; BauSheng; D. A. Holton; Gordon F. Royle 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB 👁 1 views

In this paper w e determine the circumstances under which a set of 11 vertices in a 3-connected cubic graph lies on a cycle. In addition, w e consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.

An edge-oriented adjacency list for undi

An edge-oriented adjacency list for undirected graphs

✍ L. K. Chen; B. S. Ting; A. Sangiovanni-Vincentelli 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

Turán's theorem for k-graphs

✍ Joel Spencer 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 288 KB