✦ LIBER ✦

On Trivalent Graphs

✍ Scribed by Biggs, N. L.; Smith, D. H.

Book ID: 120094280
Publisher: Oxford University Press
Year: 1971
Tongue: English
Weight: 94 KB
Volume: 3
Category: Article
ISSN: 0024-6093
DOI: 10.1112/blms/3.2.155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Trivalent Graphs

✍ Gardiner, A. 📂 Article 📅 1975 🏛 Oxford University Press 🌐 English ⚖ 195 KB

Trivalent orbit polynomial graphs

✍ Robert A. Beezer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 848 KB

Curvature dimension of trivalent graphs

✍ Kazushiro Kobayashi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 422 KB

In this paper we show that the curvature dimension, recently defined by Taniyama [5], of connected trivalent graphs in Euclidean space equals two in the case of bridgeless graphs and one for graphs having one or two bridges. We also show that there exists a connected trivalent graph in Euclidean spa

Note on Infinite Families of Trivalent S

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Seymour Lipschutz; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.

Hamilton cycles in Trivalent Cayley grap

Hamilton cycles in Trivalent Cayley graphs

✍ Meghanad D. Wagh; Jiancheng Mo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i"Cn\_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.

The pagewidth of trivalent planar graphs

✍ Elena Stöhr 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 372 KB

We prove the following result: there exist trivalent n-vertex planar graphs, any 2-page embedding of which has pagewidth Q(n).