๐”– Bobbio Scriptorium
โœฆ   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

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
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
โœ 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