𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Path-amenable Graphs

✍ Scribed by Gabriel Dirac; Ove Steen Nielsen

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
373 KB
Volume
74
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On paths in planar graphs
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 the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 491 KB πŸ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap

On the characterization of path graphs
On the characterization of path graphs
✍ Huaien Li; Yixun Lin πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 191 KB

## Abstract Broersma and Hoede have introduced path graphs. Their characterization of __P__~3~‐graphs contains a flaw. This note presents the correct form of the characterization. Β© 1993 John Wiley & Sons, Inc.

Hamiltonian path graphs
Hamiltonian path graphs
✍ Gary Chartrand; S. F. Kapoor; E. A. Nordhaus πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 389 KB

## Abstract The Hamiltonian path graph __H(G)__ of a graph __G__ is that graph having the same vertex set as __G__ and in which two vertices __u__ and __v__ are adjacent if and only if __G__ contains a Hamiltonian __u‐v__ path. A characterization of Hamiltonian graphs isomorphic to their Hamiltonia