A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Triangle-free subcubic graphs with minimum bipartite density

2008
*
Journal of combinatorial theory. Series B (Print)
*

A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is max{ε(H )/ε(G): H is a bipartite subgraph of G}, where ε(H ) and ε(G) denote the numbers of edges in H and G, respectively. It is an NP-hard problem to determine the bipartite density of any given trianglefree cubic graph. Bondy and Locke gave a polynomial time algorithm which, given a triangle-free subcubic graph G, finds a bipartite subgraph of G with at least 4 5 ε(G) edges; and showed that the

doi:10.1016/j.jctb.2007.09.001
fatcat:5dmqnvab7rcy3plq6lniqrqhwu