𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the Hamiltonian Circuit Problem on directed path graphs

✍ Scribed by Giri Narasimhan

Book ID
113163347
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
277 KB
Volume
32
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A note on Hamiltonian split graphs
A note on Hamiltonian split graphs
✍ Rainer E Burkard; Peter L Hammer πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 230 KB
A note on Hamiltonian circuits
A note on Hamiltonian circuits
✍ V. ChvΓ‘tal; P. ErdΓΆs πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 229 KB
A note on path-zero graphs
A note on path-zero graphs
✍ J.J. Seidel πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 207 KB

of the matrix equation P\*(X,,) = O,, where Pk(k) is the characteristic equation of the path-graph of length k.

A note on path-perfect graphs
A note on path-perfect graphs
✍ John Frederick Fink; H.Joseph Straight πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 498 KB

In this paper we explore the c:oncept of factoring a graph into non-isomorphic paths. Lel Pi denote the path of length i. We SAY that a graph G having $n(n + 1) edges is path-perfect if E( G) can be partitioned as E, UE, !J l \* l U & such that the subgraph of G induced by 32i is isomorphic to Pr, f