✦ LIBER ✦

Cycles in Circuit Graphs of Matroids

✍ Scribed by Ping Li; Guizhen Liu

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 212 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0739-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle lengths and circuit matroids of gr

Cycle lengths and circuit matroids of graphs

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

Tutte cycles in circuit graphs

✍ Zhicheng Gao; Xingxing Yu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Jackson and Wormald showed that every 3-cormected planar graph G contains a Tutte cycle C such that each component of G-C contains less than I V(G)I/2 vertices. We prove in this paper that IV(G)[~2 can be replaced by I V(G)I/3. This answers a question of Jackson and Wormald. This result may be used

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

Paths and cycles in matroid base graphs

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

Transversals of circuits and acyclic ori

Transversals of circuits and acyclic orientations in graphs and matroids

✍ C. Berge; M. Las Vergnas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 132 KB

The connectivity and minimum degree of c

The connectivity and minimum degree of circuit graphs of matroids

✍ Ping Li; Gui Zhen Liu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB