✦ LIBER ✦

Paths in circuit graphs of matroids

✍ Scribed by Guizhen Liu; Ping Li

Book ID: 108281404
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 435 KB
Volume: 396
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles in Circuit Graphs of Matroids

✍ Ping Li; Guizhen Liu 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 212 KB

Hamilton cycles in circuit graphs of mat

Hamilton cycles in circuit graphs of matroids

✍ Ping Li; Guizhen Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Cycle lengths and circuit matroids of gr

Cycle lengths and circuit matroids of graphs

✍ D.R. Woodall 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 331 KB

Paths and cycles in matroid base graphs

✍ Brian Alspach; Guizhen Liu 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 318 KB

On removable circuits in graphs and matr

On removable circuits in graphs and matroids

✍ Lemos, Manoel; Oxley, James 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves

Properties of Hamilton cycles of circuit

Properties of Hamilton cycles of circuit graphs of matroids

✍ Hao Fan, Guizhen Liu 📂 Article 📅 2013 🏛 Higher Education Press and Springer 🌐 English ⚖ 460 KB