✦ LIBER ✦

Classification of path-recursive graphs

✍ Scribed by Melody K. Panttaja

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 73 KB
Volume: 295
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00061-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive families of graphs

✍ N.L Biggs; R.M Damerell; D.A Sands 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 422 KB

On recursive path ordering

✍ M.S. Krishnamoorthy; P. Narendran 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 309 KB

Path graphs

✍ H. J. Broersma; C. Hoede 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 766 KB

The concept of a line graph is generalized to that of a path graph. The path graph f,(G) of a graph G is obtained by representing the paths Pk in G by vertices and joining two vertices whenever the corresponding paths f k in G form a path f k + , or a cycle C,. f,-graphs are characterized and invest

Recursive generation of partitionable gr

Recursive generation of partitionable graphs

✍ E. Boros; V. Gurvich; S. Hougardy 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Results of Lovász (1972) and Padberg (1974) imply that partitionable graphs contain all the potential counterexamples to Berge's famous Strong Perfect Graph Conjecture. A recursive method of generating partitionable graphs was suggested by Chvátal, Graham, Perold, and Whitesides (1979).

Pancyclicity of recursive circulant grap

Pancyclicity of recursive circulant graphs

✍ Toru Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic.

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