𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two matroidal families on the edge set of a graph

✍ Scribed by András Recski

Book ID
108315705
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
109 KB
Volume
251
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the two-edge-colorings of perfect gra
On the two-edge-colorings of perfect graphs
✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh

On the edge-toughness of a graph. II
On the edge-toughness of a graph. II
✍ Y. H. Peng; T. S. Tay 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

## Abstract The edge‐toughness __T__~1~(__G__) of a graph __G__ is defined as equation image where the minimum is taken over every edge‐cutset __X__ that separates __G__ into ω (__G__ ‐ __X__) components. We determine this quantity for some special classes of graphs that also gives the arboricity