𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A family of graphs with expensive depth-reduction

✍ Scribed by Georg Schnitger

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
443 KB
Volume
18
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The reduction of graph families closed u
The reduction of graph families closed under contraction
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 633 KB

Let 5~ be a family of graphs. Suppose there is a nontrivial graph H such that for any supergraph G of H, G is in 5 e if and only if the contraction G/H is in 5g. Examples of such an 0~: graphs with a spanning closed trail; graphs with at least k edge-disjoint spanning trees; and k-edge-connected gra

On the depth of a planar graph
On the depth of a planar graph
✍ Vinay G. Kane; Sanat K. Basu πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 525 KB
A Splitter for Graphs with No Petersen F
A Splitter for Graphs with No Petersen Family Minor
✍ John Maharry πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 231 KB

The Petersen family consists of the seven graphs that can be obtained from the Petersen Graph by Y2-and 2Y-exchanges. A splitter for a family of graphs is a maximal 3-connected graph in the family. In this paper, a previously studied graph, Q 13, 3 , is shown to be a splitter for the set of all grap