## Abstract Lower bounds on the size of a maximum bipartite subgraph of a triangleβfree __r__βregular graph are presented.
β¦ LIBER β¦
A note on degree-constrained star subgraphs of bipartite graphs
β Scribed by Harold N. Gabow
- Book ID
- 113161835
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 666 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A note on bipartite subgraphs of triangl
β
S. C. Locke
π
Article
π
1990
π
John Wiley and Sons
π
English
β 130 KB
π 2 views
On locating cubic subgraphs in bounded-d
β
Iain A Stewart
π
Article
π
1997
π
Elsevier Science
π
English
β 236 KB
We show that the problem of deciding whether a connected bipartite graph of degree at most 4 has a cubic subgraph is NP-complete.
A decomposition of complete bipartite gr
β
Yoshimi Egawa; Masatsugu Urabe; Toshihito Fukuda; Seiichiro Nagoya
π
Article
π
1986
π
Elsevier Science
π
English
β 114 KB
On the number of maximal bipartite subgr
β
Jesper Makholm Byskov; Bolette AmmitzbΓΈll Madsen; Bjarke Skjernaa
π
Article
π
2004
π
John Wiley and Sons
π
English
β 72 KB
π 2 views
We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ΒΌ O(1:8613 n ) and give an algorithm that finds all maximal
On bipartite distance-regular graphs wit
β
Qian Kong; Kaishun Wang
π
Article
π
2010
π
Elsevier Science
π
English
β 216 KB
A note on the f-factor-lattice of bipart
β
J Rieder
π
Article
π
1992
π
Elsevier Science
π
English
β 406 KB