𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bipartite subgraphs of triangle-free subcubic graphs

✍ Scribed by Xuding Zhu

Book ID
108167455
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
479 KB
Volume
99
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bipartite Subgraphs of Triangle-Free Gra
Bipartite Subgraphs of Triangle-Free Graphs
✍ Poljak, Svatopluk; Tuza, Zsolt πŸ“‚ Article πŸ“… 1994 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 697 KB
Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

A note on bipartite subgraphs of triangl
A note on bipartite subgraphs of triangle-free regular graphs
✍ S. C. Locke πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 2 views

## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangle‐free __r__‐regular graph are presented.

Largest bipartite subgraphs in triangle-
Largest bipartite subgraphs in triangle-free graphs with maximum degree three
✍ J. A. Bondy; S. C. Locke πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 977 KB

Let G be a triangle-free, loopless graph with maximum degree three. We display a polynomi$ algorithm which returns a bipartite subgraph of G containing at least 5 of the edges of G. Furthermore, we characterize the dodecahedron and the Petersen graph as the only 3-regular, triangle-free, loopless, c