Indexed by：
Abstract：
A bisection of a graph is a partition of its vertex set into two sets which differ in size by at most 1, and its size is the number of edges between the two sets. Let G be a graph with m edges, perfect matchings and girth at least 6. Let d1, d2, . . ., dn be vertex degrees, then there is a constant c ＞ 0 such that G admits a bisection of size at least m/2 + c ∑ni=1 di. It follows as a corollary that G has a bisection of size at least m/2 + cm3/4. © 2019 Forum-Editrice Universitaria Udinese SRL. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
Italian Journal of Pure and Applied Mathematics
ISSN： 1126-8042
Year： 2019
Issue： 42
Page： 80-87
0 . 2 0 0
JCR@2023
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 2
Affiliated Colleges：
