𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Paths and circuits in graphs: Extreme cases

✍ Scribed by G. A. Dirac

Publisher
Akadmiai Kiad
Year
1959
Tongue
English
Weight
285 KB
Volume
10
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Paths and circuits in partially directed
Paths and circuits in partially directed graphs
✍ D.W. Barnette; Shelley Gillett πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 244 KB

Although questions about Eulerian circuits, paths, and covering edges by edge disjoint paths are easily answered for graphs or directed graphs, they are not easily answered if some edges are directed and others are not. We give necessary and sufficient conditions for an Eulerian path or circuit, and

Interminable Paths and Trails: Extreme C
Interminable Paths and Trails: Extreme Cases
✍ G. A. Dirac πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 832 KB

## This paper is concerned with terminable and interminable paths and trails The only cohnected graphs which contain no 2 -way and in which no finite path is terminable are precisely all the 1m multiways. Tho only connected graphs which have no 2 -m trail and in which no finite trail is terminabl

Hamiltonian circuits and paths in subset
Hamiltonian circuits and paths in subset graphs with circular adjacency
✍ T.C. Enns πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 751 KB

Consider the subset graph G(n, k) whose vertex set C(n, k) is the set of all n-tuples of 'O's' and 'l's' with exactly k 'I's'. Let an edge exist between two vertices a and b in G(n,k) if and only if a can be transformed into b by the interchange of two adjacent coordinate values, with the first and