✦ LIBER ✦

Circuits in critical graphs

✍ Scribed by G. A. Dirac

Publisher: Springer Vienna
Year: 1955
Tongue: English
Weight: 530 KB
Volume: 59
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01303792

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On circuits in graphs

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

Induced Circuits in Planar Graphs

✍ C. Mcdiarmid; B. Reed; A. Schrijver; B. Shepherd 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Hamiltonian circuits in Cayley graphs

✍ Dragan Marušič 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 268 KB

Hamiltonian circuits in random graphs

✍ L. Pósa 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 807 KB

Even circuits in planar graphs

✍ P.D Seymour 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 606 KB

Packing Odd Circuits in Eulerian Graphs

✍ James F. Geelen; Bertrand Guenin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let C be the clutter of odd circuits of a signed graph ðG; SÞ: For nonnegative integral edge-weights w; we are interested in the linear program minðw t x: xðCÞ51; for C 2 C; and x50Þ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,