✦ LIBER ✦

On systems of paths and circuits in graphs

✍ Scribed by G. A. Dirac

Publisher: Springer
Year: 1973
Tongue: English
Weight: 871 KB
Volume: 201
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01359790

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximal paths and circuits of graphs

✍ P. Erdős; T. Gallai 📂 Article 📅 1959 🏛 Akadmiai Kiad 🌐 English ⚖ 975 KB

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

Paths and circuits in graphs: Extreme ca

Paths and circuits in graphs: Extreme cases

✍ G. A. Dirac 📂 Article 📅 1959 🏛 Akadmiai Kiad 🌐 English ⚖ 285 KB

Monochromatic paths and circuits in edge

Monochromatic paths and circuits in edge-colored graphs

✍ D.T Busolini 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 75 KB

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

On circuits in graphs

✍ Mohamed H. El-Zahar 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 196 KB