𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a matroid defined by ear-decompositions of graphs

✍ Scribed by Zoltán Szigeti

Publisher
Springer-Verlag
Year
1996
Tongue
English
Weight
486 KB
Volume
16
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A result on decompositions of regular gr
A result on decompositions of regular graphs
✍ Xiang-Ying Su 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A result on decompositions of regular graphs, Discrete Mathematics 105 (1992) 323-326. We prove that for any connected graph G and any integer r which is a common multiple of the degrees of the vertices in G, there exists a connected, r-regular, and G-decomposable graph H such that x(H) = x(G) and o

A lower bound on connectivities of matro
A lower bound on connectivities of matroid base graphs
✍ Guizhen Liu 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 853 KB

The connectivity of a graph G and the corank of a matroid M are denoted by K(G) and p, respectively. X is shown that if a graph G is the base graph of a simple mat&d M, then K(G) L 2p and the lower bound of 2p izA best possible.

A note on path and cycle decompositions
A note on path and cycle decompositions of graphs
✍ Dom Decaen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

## Abstract In the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph __G__ has a smallest path (resp. path‐cycle) decomposition __P__ such that every odd vertex of __G__ is the endpoint of exactly one path of __P__? This note g