𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal non-bipartite regular graphs of girth 4

✍ Scribed by Douglas Bauer

Book ID
107884204
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
316 KB
Volume
37
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal Regular Graphs with Prescribed
Extremal Regular Graphs with Prescribed Odd Girth
✍ G.H. Zhang πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 496 KB

The odd girth of a graph \(G\) gives the length of a shortest odd cycle in \(G\). Let \(f(k, g)\) denote the smallest \(n\) such that there exists a \(k\)-regular graph of order \(n\) and odd girth \(g\). It is known that \(f(k, g) \geqslant k g / 2\) and that \(f(k, g)=k g / 2\) if \(k\) is even. T

On the bipartite density of regular grap
On the bipartite density of regular graphs with large girth
✍ OndΕ™ej ZΓ½ka πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 1 views

## Abstract Let __B(G)__ be the edge set of a bipartite subgraph of a graph __G__ with the maximum number of edges. Let __b~k~__ = inf{|__B(G)__|/|__E(G)__β€–__G__ is a cubic graph with girth at least __k__}. We will prove that lim~k β†’ ∞~ __b~k~__ β‰₯ 6/7.

Decompositions of regular bipartite grap
Decompositions of regular bipartite graphs
✍ Michael S. Jacobson; Miroslaw TruszczyΕ„ski; Zsolt Tuza πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,