✦ LIBER ✦

Remarks on Path-transitivity in Finite Graphs

✍ Scribed by Marston D.E. Conder; Cheryl E. Praeger

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 244 KB
Volume: 17
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1996.0030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On paths in planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

This paper generalizes a theorem of Thomassen on paths in planar graphs. As a corollary, it is shown that every 4-connected planar graph has a Hamilton path between any two specified vertices x, y and containing any specified edge other than xy.

On bounded automorphisms of locally fini

On bounded automorphisms of locally finite transitive graphs

✍ Niemeyer, Peter 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This co

On Finite s-Transitive Graphs of Odd Ord

On Finite s-Transitive Graphs of Odd Order

✍ Cai Heng Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only if s 3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive.

On minimum degree in Hamiltonian path gr

On minimum degree in Hamiltonian path graphs

✍ George R. T. Hendry 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

A theorem on paths in planar graphs

✍ Norishige Chiba; Takao Nishizeki 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 1 views

C. Thomassen extended Tutte's theorem on cycles in planar graphs in the paper "A Theorem on Paths in Planar Graphs". This note corrects a flaw in his proof.

A theorem on paths in planar graphs

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 394 KB 👁 1 views

We prove a theorem on paths with prescribed ends in a planar graph which extends Tutte's theorem on cycles in planar graphs [9] and implies the conjecture of Plummer (51 asserting that every 4-connected planar graph is Hamiltonian-connected.