✦ LIBER ✦

On maximal paths and circuits of graphs

✍ Scribed by P. Erdős; T. Gallai

Publisher: Akadmiai Kiad
Year: 1959
Tongue: English
Weight: 975 KB
Volume: 10
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf02024498

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On systems of paths and circuits in grap

On systems of paths and circuits in graphs

✍ G. A. Dirac 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 871 KB

Maximal circuits of graphs. I

✍ D. R. Woodall 📂 Article 📅 1976 🏛 Akadmiai Kiad 🌐 English ⚖ 222 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

On k-path hamiltonian maximal planar gra

On k-path hamiltonian maximal planar graphs

✍ İlker Baybars 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 239 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